Leetcode 2030. Smallest K-Length Subsequence With Occurrences of a Letter

Find the lexicographically smallest subsequence of length k from s that contains at least repetition occurrences of a given letter. This requires a greedy, monotonic-stack-like selection that pops larger characters only when enough remaining characters (and required letters) remain to still build a valid subsequence.