Lexicographically smallest subsequence of size k
Filed under Dunzo
The question
Given a string s, find the lexicographically smallest subsequence of size k in O(n) time.
No write-up yet. Related questions below have one.
Related Dunzo questions
Collected from public candidate posts and coding forums. Updated Nov 2026.