# Palindrome Partitioning: Interview Notes
Palindrome Partitioning shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Backtrack every cut where s[i..j] is a palindrome (precompute a pal[i][j] table) and collect the lists of parts; this is the enumeration version, not the min-cut one.
## Steps to say out loud
1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (graph BFS, Dijkstra, Union-Find, or interval DP) 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 * 2^n).
## Common mistake
Cutting only at the first palindrome you see and missing later partitions.
## 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.