C++ super-simple and clean solution
\nclass Solution {\npublic:\n    bool isAnagram(string s, string t) {\n        if (s.size() != t.size()) return false;\n        unordered_map<char, int> s_map, 
```\nclass Solution {\npublic:\n    bool isAnagram(string s, string t) {\n        if (s.size() != t.size()) return false;\n        unordered_map<char, int> s_map, t_map;\n        for (int i=0; i<s.size(); i++)\n        {\n            s_map[s[i]]++;\n            t_map[t[i]]++;\n        }\n        return s_map == t_map;\n    }\n};\n```
['C']