# Detonate The Maximum Bombs: Study Guide

Detonate The Maximum Bombs shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Directed graph: i reaches j if dist^2 <= radius_i^2; DFS/BFS from each bomb to count the cascade.

## 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^2).

## Common mistake

Treating the graph as undirected (radii are not symmetric).

## 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 interview copilot app.