Collections fast and simple solution
Intuition\nI can use built-in collections to solve this issue instead of more popular solutions like sorted, len or set.\n\n# Approach\nWe use the collections.C
# Intuition\nI can use built-in collections to solve this issue instead of more popular solutions like `sorted`, `len` or `set`.\n\n# Approach\nWe use the `collections.Counter` function for creating a **hash-table based dict** to store the frequency of each character in the input strings. The size of the dict is proportional to the size of the input strings.\n\nAnd then we\'re comparing two hash tables which has O(1) time complexity.\n\n# Complexity\n- Time complexity:\n$$O(n)$$\n\n- Space complexity:\n$$O(n)$$\n\n# Code\n```\nclass Solution:\n    def isAnagram(self, s: str, t: str) -> bool:\n        return collections.Counter(s) == collections.Counter(t)\n```
['Hash Table', 'Python', 'Python3']