# Count Unguarded Cells In The Grid: Practice Notes
Count Unguarded Cells In The Grid shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Guards see along rows/columns until a wall or another guard. Mark guarded cells by sweeping each row and column in both directions (or simulating rays from every guard). Remaining empty cells are unguarded.
## Steps to say out loud
1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (binary search on the answer, monotonic stack or deque, interval / interval-DP, string hashing, graph traversal, or shortest paths) and why a nested scan or naive search fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.
## Complexity
O(mn).
## Common mistake
BFS from guards that travels through walls, or recounting a cell for every guard that sees it without a visited mark.
## 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.