← Amazon questions

Maximum palindrome by replacing characters

Filed under Amazon

Given a string of digits of length n and an integer k, find the lexicographically largest palindrome possible by changing at most k digits. Return -1 if it is impossible to form a palindrome within k…

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.