Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
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.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.