Only Using Map Explained ✅✔️
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    int minimumDeletions(string word, int k) {\n         unordered_map<char,int>mp;\n        for(auto it:word) mp[it]++;\n        int ans=INT_MAX;\n        for(auto it:mp){\n            int res=0;\n            int limit=it.second;\n            for(auto it:mp){\n                if(it.second>limit+k){\n                    res+=it.second-(limit+k);\n                }\n                else if(it.second<limit)res+=it.second; // see again\n            }\n            if(ans==0) break;\n            ans=min(ans,res);\n        }\n        if(ans==INT_MAX) return 0;\n        return ans;\n        \n    }\n};\n```
['C++']