Leetcode Problem 2101. Detonate the Maximum Bombs

2101. Detonate the Maximum Bombs

Leetcode Solutions

Initialize answer as 0.
Create a hash map graph containing all directed edges corresponding to the detonation relationships between all bombs.
Create an empty hash set visited.
Define a recursive function dfs(cur) to recursively find all reachable nodes from node cur:
- Add cur to visited.
- Recursively call dfs(neib) on each unvisited neighbor of cur.
Repeat from step 3 for each node i and update answer as the maximum size of visited after each DFS.
Return answer when all DFS operations are complete.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen