# Find the Closest Palindrome (LC5251) ## Problem Interview classic: Find the Closest Palindrome. ## Approach Generate candidates from half-mirror; pick nearest != n. ## Complexity Time/space depend on constraints; aim for the optimal DP/graph solution above. ## Practice tip Walk through a small example out loud, state invariants, then code. Practice with [www.linkjob.ai](https://www.linkjob.ai/).