# Bomb Enemy: Interview Notes
Bomb Enemy shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Precompute for each cell how many enemies are hit in its row and column segment between walls. Recompute a row count only after a wall, so each cell does constant amortized work.
## 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
Scanning four directions from every empty cell, which is O(mn(m+n)).
## 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 copilot.