Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 2030. Smallest K-Length Subsequence With Occurrences of a Letter
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source