# Partition Equal Subset Sum: Interview Notes
Partition Equal Subset Sum shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
The target is total/2 (total must be even); 0-1 knapsack / bitset DP over the numbers to see if some subset hits the target.
## 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 * sum).
## Common mistake
Splitting by a single cut of the array rather than an arbitrary subset.
## 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.