simple java 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 {\n    public int minimumDeletions(String word, int k) {\n        int []arr=new int[26];\n        for(int i=0;i<word.length();i++){\n            char ch=word.charAt(i);\n            arr[ch-\'a\']++;\n        }\n        int del=Integer.MAX_VALUE;\n        for(int i=0;i<26;i++){\n            int freq=arr[i];\n            int delete=0;\n            for(int j=0;j<26;j++){\n                if(i==j){\n                    continue;\n                }\n                if(arr[j]<freq){\n                    delete+=arr[j]; \n                }\n                else if(Math.abs(arr[j]-freq)>k){\n                  delete+=Math.abs(arr[j]-freq-k); // itne charcters delete honge...\n                }\n            }\n            del=Math.min(del,delete);\n        }\n        return del;\n    }\n}\n```
['Array', 'String', 'Java']