short and sweet JS solution using BFS
Intuition\nA new bomb explodes if its distance to the current bomb is less than the radius of the current bomb. \nWe can calculate this with a^2 + b^2 = c^2\nWe
# Intuition\nA new bomb explodes if its distance to the current bomb is less than the radius of the current bomb. \nWe can calculate this with a^2 + b^2 = c^2\nWe can use BFS to check which bombs explodes, by adding exploding boms to our queue. \nWe have to check what the maximum number of exploding bombs is for each starting bomb, since order matters here, which is fine, since there are only 100 bombs\n\n# Approach\nBFS\n\n# Complexity\n- Time complexity:\nO(n^3)\n\n- Space complexity:\nnot sure, we only create one queue and one set at a time, so O(n)?\n# Code\n```\n/**\n * @param {number[][]} bombs\n * @return {number}\n */\nvar maximumDetonation = function(bombs) {\n    let answer = 0\n    for (let i  = 0; i < bombs.length; i++) {\n        const exploded = new Set([i])\n        const queue = [bombs[i]]\n        while(queue.length > 0) {\n            const bomb = queue.shift()\n            for (let j = 0; j < bombs.length; j++) {\n                if (exploded.has(j)) continue\n                const newBomb = bombs[j]\n                const distance = ((Math.abs(newBomb[0] - bomb[0])**2 )+ (Math.abs(newBomb[1] - bomb[1])**2)) ** 0.5\n                if (distance <= bomb[2]) {\n                    queue.push(newBomb)\n                    exploded.add(j)\n                }\n            }\n        }\n        answer = Math.max(exploded.size, answer)\n    }\n    return answer\n};\n```
['JavaScript']