Leetcode 3545. Minimum Deletions for At Most K Distinct Characters

Given a lowercase string s and integer k, delete the fewest characters so the resulting string contains at most k distinct letters. The optimal approach is to keep the k most frequent characters and remove all occurrences of the rest, minimizing total deletions.

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 3545. Minimum Deletions for At Most K Distinct Characters

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact