2025-08-24 14:52:40 +0000 UTC

Minimum Deletions for At Most K Distinct Characters
Categories:
Tags:

Code

class Solution:
    def minDeletion(self, s: str, k: int) -> int:
        freqs, n = [0] * 26, len(s)
        for i in range(n):
            freqs[ord(s[i]) - 97] += 1
        freqs.sort(reverse=True)
        res = 0
        while len(freqs) > k:
            res += freqs.pop()
        return res