Hash table with python: Runtime: 24 ms, faster than 98.88%
\n    def isAnagram(self, s, t):\n        dictionary = {}\n        \n        for i in s:\n            if i in dictionary:\n                dictionary[i] += 1\n 
```\n    def isAnagram(self, s, t):\n        dictionary = {}\n        \n        for i in s:\n            if i in dictionary:\n                dictionary[i] += 1\n            else:\n                dictionary[i] = 1\n\n        for i in t:\n            if i in dictionary:\n                dictionary[i] -= 1\n            else:\n                return False\n\n        for val in dictionary.values():\n            if val != 0:\n                return False\n        \n        return True\n```
['Hash Table', 'Python', 'Python3']