← Amazon questions

Maximum number possible by at most K adjacent swaps

Filed under Amazon

Given a string representation of a number, find the maximum possible number you can achieve by performing at most K adjacent swaps.

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Amazon questions

Collected from public candidate posts and coding forums. Updated Nov 2026.