Lexicographically smallest string after k adjacent swaps
Filed under HashedIn
The question
Find the lexicographically smallest string possible after at most k adjacent swaps.
No write-up yet. Related questions below have one.
Related HashedIn questions
Collected from public candidate posts and coding forums. Updated Nov 2026.