# Find Eventual Safe States: Interview Notes
Find Eventual Safe States shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
A node is safe if every path ends in a terminal; color DFS (or reverse-graph Kahn) to detect nodes on cycles.
## 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(V+E).
## Common mistake
Returning only outdegree-0 nodes and missing nodes that lead only to other safe nodes.
## 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.