Valid Anagram
Difficulty: EasyTopic: Hash TableStringSortingLeetcode:242.Valid AnagramGiven two strings s and t, return true if t is an anagram of s, and false otherwise.
An Anagram is a word or phrase formed by rearranging the letters of a different word or phrase, typically using all the original letters exactly once.
Example 1:
Input: s = "anagram", t = "nagaram"
Output: true
Example 2:
Input: s = "rat", t = "car"
Output: false
Constraints:
1 <= s.length, t.length <= 5 * 104sandtconsist of lowercase English letters.
Follow up: What if the inputs contain Unicode characters? How would you adapt your solution to such a case?
Solution
write solution in here
/**
* @param {string} s
* @param {string} t
* @return {boolean}
*/
var isAnagram = function(s, t) {
const sa = s.split("").sort((a, b) => a.charCodeAt() - b.charCodeAt()),
ta = t.split("").sort((a, b) => a.charCodeAt() - b.charCodeAt())
if(ta.length !== sa.length) return false
for(let i = 0; i < ta.length; i ++) {
if (sa[i] !== ta[i]) return false
}
return true
};