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.