Valid Anagram

Problem Description

Given two strings s and t, return true if t is an anagram of s, and false otherwise.

Example 1:

Example 2:

Constraints:

• 1 <= s.length, t.length <= 5 * 104
• s and t consist of lowercase English letters.

Follow up: What if the inputs contain Unicode characters? How would you adapt your solution to such a case?

Solution (JavaScript)

/**
 * @param {string} s
 * @param {string} t
 * @return {boolean}
 */
var isAnagram = function(s, t) {
    if (s.length !== t.length) {
        return false;
    }
    const c = new Array(26).fill(0);
    for (let i = 0; i < s.length; i++) {
        c[s[i].charCodeAt(0)-97]++;
        c[t[i].charCodeAt(0)-97]--;
    }
    for (const n of c) {
        if (n !== 0) {
            return false;
        }
    }
    return true;
};