[LeetCode]242. Valid Anagram | Array

Valid Anagram - LeetCode

My solution

/**
 * @param {string} s
 * @param {string} t
 * @return {boolean}
 */
var isAnagram = function(s, t) {
    const sArr = s.split('');
    const tArr = t.split('')

    let temp = [];

    for(let i=0; i<sArr.length; i++) {
        if(sArr.includes(tArr[i])) {
            temp.push(sArr[i])
        }
    }

    if(temp.length === sArr.length) return true;
    else return false;
};

2nd attempt

/**
 * @param {string} s
 * @param {string} t
 * @return {boolean}
 */
var isAnagram = function(s, t) {
    const sArr = s.split('').sort()
    const tArr = t.split('').sort()

    console.log(sArr, tArr)

   
    let temp = [];

    if(sArr.length !== tArr.length) return false;

    for(let i=0; i<sArr.length; i++) {
        if(sArr[i] !== tArr[i]) return false;

        if(sArr.includes(tArr[i])) {
            temp.push(sArr[i])
        }
    }

    if(temp.length === sArr.length) return true;
    else return false;
};

=> Testcases passed, but took too long.

oh i thought it has to check if two strings are anagrams

Accepted

/**
 * @param {string} s
 * @param {string} t
 * @return {boolean}
 */
var isAnagram = function(s, t) {
    const sArr = s.split('').sort()
    const tArr = t.split('').sort()

    console.log(sArr, tArr)

   
    let temp = [];

    if(sArr.length !== tArr.length) return false;

    for(let i=0; i<sArr.length; i++) {
        if(sArr[i] !== tArr[i]) return false;

       
    }

   return true;
};