Python 3 (60ms) | HashMap Dictionary Solution | Easy to Understand
\nclass Solution:\n    def isAnagram(self, s: str, t: str) -> bool:\n        dict = {}\n        for ele in s:\n            if ele not in dict:\n                
```\nclass Solution:\n    def isAnagram(self, s: str, t: str) -> bool:\n        dict = {}\n        for ele in s:\n            if ele not in dict:\n                dict[ele] = 1\n            else:\n                dict[ele] += 1\n        for ele in t:\n            if ele not in dict:\n                return False\n            else:\n                dict[ele] -= 1\n        return False if any(dict.values()) else True\n```
['Python']