Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 2 records
Freshworks
Leetcode 1647. Minimum Deletions to Make Character Frequencies Unique
Reported Mar 30, 2026 · 1 source report
SENIOR
Source snapshot: Nov 12, 2026
View sourceMicrosoft
Leetcode 1647. Minimum Deletions to Make Character Frequencies Unique
Reported Jun 21, 2026 · 1 source report
JUNIOR
Source snapshot: Nov 12, 2026
View source