stoi nhi chaheye uske bina kr skte num[i]-'0' technique :D
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```cpp []\nclass Solution {\npublic:\n    bool digitCount(string num) {\n        int arr[10]={0};\n\n        for(int i=0;i<num.length();i++)\n        {\n             arr[num[i]-\'0\']++;\n        }\nint c=0;\n        for(int i=0;i<num.length();i++)\n        {\n            \n             if(arr[i]==(num[i]-\'0\'))\n              c++;\n          \n\n        }\n        if(c==num.length())    \n           return true;\n        return false;   \n    }\n};\n```
['C++']