# Palindrome Linked List: Interview Notes
Palindrome Linked List shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Find the middle, reverse the second half, compare pairwise, then optionally restore. Extra O(1) space, unlike copying into an array.
## Steps to say out loud
1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (linked-list rewiring, two pointers, or a monotonic stack) and why a simpler scan fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.
## Complexity
O(n) extra O(1).
## Common mistake
Comparing the first half to itself, or forgetting that an odd-length middle should be skipped.
## 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 Linkjob AI copilot.