JavaScript - DFS Solution
\n/**\n * @param {number[][]} bombs\n * @return {number}\n */\nvar maximumDetonation = function(bombs) {\n    if(bombs.length <= 1) return bombs.length;\n    \n
```\n/**\n * @param {number[][]} bombs\n * @return {number}\n */\nvar maximumDetonation = function(bombs) {\n    if(bombs.length <= 1) return bombs.length;\n    \n    let adj = {}, maxSize = 0;\n    const checkIfInsideRange = (x, y, center_x, center_y, radius) =>{\n        return ( (x-center_x)**2 + (y-center_y)**2 <= radius**2 ) \n    }\n\t\n\t//CREATE ADJACENCY MATRIX\n    for(let i = 0;i<bombs.length;i++){\n        for(let j = i+1;j<bombs.length;j++){\n            if(!adj[i]) adj[i] = [];\n            if(!adj[j]) adj[j] = [];\n            let bombOne = bombs[i];\n            let bombTwo = bombs[j];\n            let fir = checkIfInsideRange(bombOne[0], bombOne[1], bombTwo[0], bombTwo[1], bombOne[2]);     \n            if(fir) adj[i].push(j);\n            let sec = checkIfInsideRange(bombOne[0], bombOne[1], bombTwo[0], bombTwo[1], bombTwo[2]);\n            if(sec) adj[j].push(i);\n        }\n    }\n\t\n\t//DEPTH FIRST SEARCH TO FIND ALL BOMBS TRIGGERED BY NODE\n    const dfs = (node, visited)=>{\n        let detonated = 1;\n        visited[node] = true;\n        let childs = adj[node] || []\n        for(let child of childs){\n            if(visited[child]) continue;\n            detonated += dfs(child, visited)\n        }\n        maxSize = Math.max(maxSize, detonated)\n        return detonated;\n    }\n    \n    for(let i = 0 ;i<bombs.length;i++){\n        dfs(i, {})\n    }\n    return maxSize\n};\n```
['Depth-First Search', 'JavaScript']