# Lexicographically Smallest Beautiful String: Walkthrough
Lexicographically Smallest Beautiful String shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
A beautiful string has no palindrome substring of length 2 or 3 (no two equal adjacent chars and no s[i]==s[i+2]). Increment the string like a base-k number from the right, then greedily fill the suffix with the smallest letters that keep those two local constraints.
## 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
Only forbidding adjacent equals and forgetting the length-3 palindrome, or incrementing without repairing the suffix.
## 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 real-time AI interview assistant for live interviews.