Simple and easy hash-map python solution | O(N)
\nclass Solution:\n    def isAnagram(self, s: str, t: str) -> bool:\n        d = {}\n        for i in s:\n            if i in d: d[i] += 1\n            else: d[
```\nclass Solution:\n    def isAnagram(self, s: str, t: str) -> bool:\n        d = {}\n        for i in s:\n            if i in d: d[i] += 1\n            else: d[i] = 1\n        for i in t:\n            if i in d: d[i] -= 1\n            else: return False\n        for k, v in d.items(): \n            if v != 0: return False\n        return True\n```\nFor more such questions: https://github.com/vanigupta20024/Programming-Challenges
['Python', 'Python3']