# Find Duplicate Subtrees: Interview Notes
Find Duplicate Subtrees shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Serialize each subtree (e.g. postorder with nulls) into a string and count occurrences; the second time a serialization appears, record that node.
## Steps to say out loud
1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (tree DFS, BST walk, or subtree 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).
## Common mistake
Comparing only the root values of subtrees.
## 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.