⚠ Easy Python Solution using Hashmap ☢
\nclass Solution:\n    def digitCount(self, num: str) -> bool:\n        \n        h = {}\n        n = len(num)\n        \n        for i in range(n):\n          
```\nclass Solution:\n    def digitCount(self, num: str) -> bool:\n        \n        h = {}\n        n = len(num)\n        \n        for i in range(n):\n            h[i] = num[i]\n            \n        for i in h:\n            if(num.count(str(i))!=int(h[i])):\n                return 0\n        \n        return 1\n```
['Python']