NeetCode #802LC-1647MediumGreedy
← Back to All Problems#802 · #1647 · Minimum Deletions to Make Character Frequencies Unique(字符频次唯一的最小删除次数)
📌 Problem Statement & Constraints
A string
s is good if no two different characters have the same frequency. Return the minimum number of deletions to make s good. Constraints: 1 <= s.length <= 10^5, s consists of lowercase English letters.🔒
Sign In to Unlock Full Solutions for All 973 Problems
Sign in to access step-by-step logic, benchmark Python3 code, complexity breakdown, and offline export!