# [242\. Valid Anagram](https://leetcode.com/problems/valid-anagram/)

:::spoiler Solution

class Solution {
public:
    bool isAnagram(string s, string t)
    {
        if (s.size() != t.size()) return false;

        unordered_map<char, int> m;

        for(auto& c : s) ++m[c];

        for (auto& c : t)
        {
            if (m.count(c))
            {
                --m[c];
                if (!m[c]) m.erase(c);
            }
        }
        return !m.size();
    }
};

- T: $O(N)$
- S: $O(1)$
:::