Python : count anagram
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution:\n    def countAnagrams(self, s: str) -> int:\n        def display(word):\n            fact=math.factorial(len(word))\n            hashmap={}\n            for w in word:\n                hashmap[w]=hashmap.get(w,0)+1\n            \n            for val in hashmap.values():\n                fact//=math.factorial(val)\n            \n            return fact\n        ways=1\n        for word in s.split():\n            ways*=display(word)\n        return ways%((10**9)+ 7)\n        \n```
['Hash Table', 'Python', 'Python3']