Available question text
Given a lowercase string, make the minimum number of character replacements to turn it into a palindrome and, among all such minimal-change palindromes, return the lexicographically smallest one. Key idea: handle each mirrored pair independently—when characters differ, replace them with the smaller letter.
Related questions
Continue with questions that share topics or the same question type.
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 2697. Lexicographically Smallest Palindrome
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source