Easy C++ solution !! ✅
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 {\npublic:\n    bool digitCount(string nums) {\n        unordered_map<int,int>mp;\n        int n=nums.size();\n        for(int i=0;i<n;i++)\n        {\n            mp[nums[i]-\'0\']++;\n        }\n        for(int i=0;i<n;i++)\n        {\n            if(mp[i]!=nums[i]-\'0\')\n                return 0;\n        }\n        return 1;\n\n    }\n};\n```
['C++']