# Lexicographically Smallest Palindrome: Interview Notes
Lexicographically Smallest Palindrome shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
You may only replace a letter with a lexicographically smaller one, and the result must be a palindrome. Two pointers: for each pair (s[i], s[n-1-i]) write the min of the two on both sides.
## Steps to say out loud
1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (binary search on the answer, monotonic stack or deque, interval / interval-DP, string hashing, graph traversal, or shortest paths) and why a nested scan or naive search fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.
## Complexity
O(n).
## Common mistake
Writing the max (that would be the largest palindrome) or changing a letter to something that is not equal to one of the two originals.
## Practice tip
Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at AI interview assistant.