Leetcode 1328. Break a Palindrome

Given a palindromic lowercase string, change exactly one character to produce the lexicographically smallest string that is not a palindrome (or return empty if impossible). The core challenge is using the string's symmetry to choose the single replacement that yields the smallest lexicographic change while handling short-edge cases.

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 1328. Break a Palindrome

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact