Unique Frequency Problem Statement

Given a string 'STR' with lowercase letters, determine the minimum number of deletions required to ensure that every letter in the string appears a unique number of times.

Example:

Input:

S = "aaBBccc"

Output:

1

Explanation:

The frequencies of the characters are {a:2, B:2, c:3}. Deleting one character from 'a' or 'B' adjusts the frequency so each is unique, resulting in frequencies 1, 2, and 3.

Input:

The first line of input contains a single integer 'T', denoting the number of test cases.
The first line of each test case contains a string 'STR'.

Output:

For each test case, print an integer indicating the minimum number of characters to delete such that each character frequency is unique.

Constraints:

• 1 <= T <= 10
• 1 <= |STR| <= 10⁵
• Time limit: 1 sec

Note:

You are not required to print the output; it has already been taken care of. Implement the function accordingly.