Leetcode 1647. Minimum Deletions to Make Character Frequencies Unique

Given a string s, find the minimum number of character deletions required so that no two different characters have the same (nonzero) frequency. This reduces to counting character frequencies and greedily resolving duplicate counts (possibly reducing some to zero); n ≤ 10^5, lowercase letters.