C++ || simple 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```cpp []\nclass Solution {\npublic:\n    int minimumDeletions(string word, int k) {\n        unordered_map<int,int> freq;\n        int n = word.size();\n        for(int i = 0; i < n; i++) {\n            freq[word[i] - \'a\']++;\n        }\n        vector<int> f;\n        for(auto it : freq) {\n            f.push_back(it.second);\n        }\n        int ans = 1e9;\n        for(int i = 0; i < f.size(); i++) {\n            int cnt = f[i];\n            int del = 0;\n            for(auto it : freq) {\n                int frequency = it.second;\n                if(frequency < cnt) del += frequency;\n                else if(frequency > cnt + k) {\n                    del += frequency - (cnt+k);\n                }\n            }\n            ans = min(del, ans);\n        }\n        return ans;\n    }\n};\n```
['C++']