Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 3085. Minimum Deletions to Make String K-Special
Given a lowercase string and integer k, delete the fewest characters so that the frequencies of all remaining letters differ by at most k (i.e., after deletions max_freq - min_freq ≤ k). The task is to choose final counts (possibly zeroing some letters) from the original character counts to satisfy this constraint while minimizing total deletions.
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.