← Amazon questions

Form largest number after K adjacent swaps

Filed under Amazon

Given a string or array representing a large number and an integer K, find the lexicographically largest possible number that can be obtained 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.