Available question text
Given bombs as circles (xi, yi, ri), form a directed graph where there is an edge i→j if bomb j's center lies within bomb i's radius (chain detonations follow edges). The task is to compute the maximum number of bombs reachable from any single start node (i.e., max reachability in this geometric directed graph), with n ≤ 100 allowing O(n^2) edge construction.
Related questions
Continue with questions that share topics or the same question type.
- All the Pairs With the Maximum Number of Common Followers
Coding
- Average Salary Excluding the Minimum and Maximum Salary
Coding
- Binary Tree Maximum Path Sum
Coding · Binary Tree · Depth-First Search · DP on Trees
- Build Array Where You Can Find The Maximum Exactly K Comparisons
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
Airbnb
Leetcode 2101. Detonate the Maximum Bombs
Reported Jul 31, 2026 · 3 source reports
MID_LEVEL, SENIOR
Source snapshot: Nov 12, 2026
View source