Minimum Deletions for At Most K Distinct Characters - Practice Coding | SlaveCode
0
0123456789
0
0123456789
:
0
0123456789
0
0123456789
3545. Minimum Deletions for At Most K Distinct Characters
Easy
10 Points
Hash Table
String
Greedy
Sorting
Counting
You are given a string s consisting of lowercase English letters, and an integer k.
Your task is to delete some (possibly none) of the characters in the string so that the number of distinct characters in the resulting string is at most k.
Return the minimum number of deletions required to achieve this.
Examples
Example 1
Input: s = "abc", k = 2
Output: 1
Explanation:
Example 2
Input: s = "aabb", k = 2
Output: 0
Explanation:
Example 3
Input: s = "yyyzz", k = 1
Output: 2
Explanation:
Constraints
1 <= s.length <= 16
1 <= k <= 16
s consists only of lowercase English letters.
3545. Minimum Deletions for At Most K Distinct Characters
Easy
10 Points
Hash Table
String
Greedy
Sorting
Counting
You are given a string s consisting of lowercase English letters, and an integer k.
Your task is to delete some (possibly none) of the characters in the string so that the number of distinct characters in the resulting string is at most k.
Return the minimum number of deletions required to achieve this.