# Longest Palindrome: Study Guide
Longest Palindrome shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Build the longest palindrome from the available letters (reorder freely). Count frequencies; add every even count plus the largest leftover 1 (one odd center). Sum of even parts of all counts, plus 1 if any odd exists.
## 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
Requiring the palindrome to be a substring of the original string (that is a different problem) or adding every odd count in full.
## 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 official website.