# Keys And Rooms: Explained
Keys And Rooms shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
BFS/DFS from room 0, collecting keys as you go; you can visit every room iff the visited set reaches n.
## 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+k).
## Common mistake
Assuming rooms are numbered so room i always opens room i+1, which is not in the problem.
## 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 www.linkjob.ai.