Given a string s, an integer k, a character letter, and an integer repetition, return the lexicographically smallest subsequence of s of length k that contains letter at least repetition times.
A subsequence is a string that can be derived from another string by deleting some or no characters without changing the order of the remaining characters.
Constraints:
repetition k s.length
s consists of lowercase English letters.
letter is a lowercase English letter, and appears in s at least repetition times.
Given a string s, an integer k, a character letter, and an integer repetition, return the lexicographically smallest subsequence of s of length k that contains letter at least repetition times.
A subsequence is a string that can be derived from another string by deleting some or no characters without changing the order of the remaining characters.
Constraints:
repetition k s.length
s consists of lowercase English letters.
letter is a lowercase English letter, and appears in s at least repetition times.