Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
- Can Make Palindrome from Substring
Coding
- Check If a String Can Break Another String
Coding
- Construct K Palindrome Strings
Coding
- Count Paths That Can Form a Palindrome in a Tree
Coding · Bit Manipulation · Depth-First Search · Hash Table
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 1328. Break a Palindrome
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source