# Evaluate Division: Interview Notes
Evaluate Division shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Build a weighted directed graph (a/b = v and b/a = 1/v) and DFS/BFS each query, or union-find with ratio-to-parent.
## 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/DFS, union-find, topological sort, or tree 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+Q) * α) union-find or O(N+Q) DFS with memo.
## Common mistake
Forgetting the reverse edge, so some queries look disconnected.
## 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 interview assistant.