Package g1601_1700.s1647_minimum_deletions_to_make_character_frequencies_unique

Class Solution

java.lang.Object
g1601_1700.s1647_minimum_deletions_to_make_character_frequencies_unique.Solution
public class Solution extends java.lang.Object
1647 - Minimum Deletions to Make Character Frequencies Unique.

Medium

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.

  • Constructor Summary

    Constructors
    Constructor
    Description
    Solution()
     

  • Method Summary

    Modifier and Type
    Method
    Description
    int
    minDeletions(java.lang.String s)
     

    Methods inherited from class java.lang.Object

    clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

  • Constructor Details

    • Solution

      public Solution()

  • Method Details

    • minDeletions

      public int minDeletions(java.lang.String s)