Available question text
Given a grid with walls, enemies, and empty cells, find the maximum number of enemies that can be killed by placing a bomb in a single empty cell which destroys all enemies along its row and column until blocked by walls. The key is to compute enemy counts for row/column segments between walls (via scanning and caching) to avoid re-counting for every empty cell.
Related questions
Continue with questions that share topics or the same question type.
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
No company association
Leetcode 361. Bomb Enemy
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source