A string s is called good if no two distinct characters have the same frequency.

Given a string s, return the minimum number of character deletions required to make s good.

Note: Characters with a frequency of $0$ are not considered to share a frequency with any remaining character, as they no longer appear in the string.

Constraints:

• $1 \leq$ s.length $\leq 10^5$

• s consists only of lowercase English letters.

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.