# Palindrome Partitioning: Practice Notes

Palindrome Partitioning shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

DFS: at each start index try every end where s[start:end+1] is a palindrome and recurse on the rest. Expand-around-center precheck speeds the is-palindrome test.

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (bitmasks, backtracking with pruning, 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 even or odd lengths and missing mixed palindrome 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 assistant for technical interviews.