# Matchsticks To Square: Interview Notes
Matchsticks To Square shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
The perimeter must be divisible by 4; then partition the sticks into four subsets each summing to side, trying larger sticks first and pruning overfills.
## 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(4^n) pruned.
## Common mistake
Only checking that the total length is divisible by 4 and skipping the partition.
## 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 undetectable AI interview copilot.