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.