Smallest K-Length Subsequence With Occurrences of a Letter
Find the lexicographically smallest length-k subsequence containing enough copies of a required letter.
Find the lexicographically smallest length-k subsequence containing enough copies of a required letter.