# Perfect Squares: Practice Notes

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

## Key idea

The same unbounded knapsack with coins 1,4,9,... or a BFS on the integer graph where edges subtract a square.

## 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 √n).

## Common mistake

Always subtracting the largest square (Lagrange is at most 4, but greedy is not always optimal for the exact min count).

## 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 real-time interview help.