Shortest, Easiest, Clean & Clear | To the Point & Beginners Friendly Approach (❤️ ω ❤️)
Code\n\nclass Solution {\npublic:\n    int minimumDeletions(string word, int k) {\n        vector<int>v(26,0);\n        for(auto i:word)v[i-\'a\']++;\n        i
# Code\n```\nclass Solution {\npublic:\n    int minimumDeletions(string word, int k) {\n        vector<int>v(26,0);\n        for(auto i:word)v[i-\'a\']++;\n        int y=INT_MAX;\n        for(int i=0;i<v.size();i++){\n            int x=0;\n            for(int j=0;j<v.size();j++){\n                if(i!=j&&v[j]<v[i])x+=v[j];\n                else if(abs(v[i]-v[j])>k)x+=abs(v[i]-v[j])-k;\n            }\n            y=min(y,x);\n        }\n        return y;\n\n//  if you like my approach then please UpVOTE o((>\u03C9< ))o\n    }\n};\n```\n\n![f5f.gif](https://assets.leetcode.com/users/images/0baec9b8-8c77-4920-96c5-aa051ddea6e4_1702180058.2605765.gif)\n![IUeYEqv.gif](https://assets.leetcode.com/users/images/9ce0a777-25fd-4677-8ccc-a885eb2b08f0_1702180061.2367256.gif)
['C++']