242-valid-anagram

242. Valid Anagram (Easy) (https://leetcode.com/problems/valid-anagram/)

Given two strings s and t, return true if t is an anagram of s, and false otherwise. Constraints: 1 <= s.length, t.length <= 5 * 10^4 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?

function isAnagram(s: string, t: string): boolean {
    if (s.length !== t.length) return false
 
    const mp: Map<string, number> = new Map();
 
    for (const ch of s) {
        mp.set(ch, (mp.get(ch) || 0) + 1)
    }
 
    for (const ch of t) {
        const curr = mp.get(ch)
        if (!curr) return false
        if (curr === 1) mp.delete(ch)
        else mp.set(ch, curr - 1)
    }
 
    return true
}
 
// Local check:
console.log(isAnagram("anagram", "nagaram")) // true
console.log(isAnagram("rat", "car")) // false

Example 1:
 
    Input: s = "anagram", t = "nagaram"
    Output: true
    Explanation: "nagaram" is an anagram of "anagram".
 
  Example 2:
 
    Input: s = "rat", t = "car"
    Output: false
    Explanation: "car" is not an anagram of "rat".

hash-table 49 — группировка анаграмм leetcode