Search

Minimum Deletions to Make Character Frequencies Unique

A string s is called good if there are no two different characters in s that have the same frequency.

Given a string s, return the minimum number of characters you need to delete to make s good.

The frequency of a character in a string is the number of times it appears in the string. For example, in the string "aab", the frequency of 'a' is 2, while the frequency of 'b' is 1.

Example 1:

Input: s = "aab"
Output: 0
Explanation: s is already good.

Example 2:

Input: s = "aaabbbcc"
Output: 2
Explanation: You can delete two 'b's resulting in the good string "aaabcc".
Another way it to delete one 'b' and one 'c' resulting in the good string "aaabbc".

Example 3:

Input: s = "ceabaacb"
Output: 2
Explanation: You can delete both 'c's resulting in the good string "eabaab".
Note that we only care about characters that are still in the string at the end (i.e. frequency of 0 is ignored).

Constraints:

  • 1 <= s.length <= 105

  • s contains only lowercase English letters.

Solution:

class Solution {
    public int minDeletions(String s) {
        int[] ch = new int[26];
        int result=0;
        Set<Integer> used = new HashSet<>();
        for(char c:s.toCharArray())
        {
            ch[c-'a']++;
        }
        Arrays.sort(ch);
        for(int i=0;i<ch.length;i++)
        {
            while(ch[i]>0 && used.contains(ch[i]))
            {
                ch[i]--; 
                result++;
            }
            used.add(ch[i]);
               
        }
        return result;
    }
}


23 views0 comments

Recent Posts

See All

The numeric value of a lowercase character is defined as its position (1-indexed) in the alphabet, so the numeric value of a is 1, the numeric value of b is 2, the numeric value of c is 3, and so on.

You are given a string s. We want to partition the string into as many parts as possible so that each letter appears in at most one part. Note that the partition is done so that after concatenating al