Simple Java DFS [Faster than 90%]
Here is a brute force solution. TC might be improved. \n\nThis below snippet code improves the runtime to 90%\n\n\nif(k == bombs.length){ //improves runtime.\n 
Here is a brute force solution. TC might be improved. \n\nThis below snippet code improves the runtime to 90%\n\n```\nif(k == bombs.length){ //improves runtime.\n     return k;\n }\n```\n\n```\nclass Solution {\n    Map<Integer, List<Integer>> map = new HashMap<>();\n    public int maximumDetonation(int[][] bombs) {\n        \n        for(int i=0; i<bombs.length; i++){\n            int[] b1 = bombs[i];\n            for(int j=0; j<bombs.length; j++){\n                if(i == j){\n                    continue;\n                }\n                int[] b2 = bombs[j];\n                if(isInside(b1[0], b1[1], b1[2], b2[0], b2[1])){\n                    map.putIfAbsent(i, new ArrayList<>());\n                    map.get(i).add(j);\n                }\n            }\n        }\n\n        int max = 0;\n        for(int i=0; i<bombs.length; i++){\n            int k = dfs(i, new boolean[bombs.length]);\n            if(k == bombs.length){ //improves runtime.\n                return k;\n            }\n            max = Math.max(max, k);\n        }\n\n        return max;\n    }\n    \n    private int dfs(int node, boolean[] vs){\n        if(vs[node]){\n            return 0;\n        }\n        vs[node] = true;\n        \n        int res = 1;\n        for(int nei : map.getOrDefault(node, new ArrayList<>())){\n            res += dfs(nei, vs);\n        }\n\n        return res;\n    }\n    \n\t//if a circle touches or crosses another circle\'s center then detonating the previos circle will also detonate this circle.\n    private boolean isInside(long x1, long y1,\n                            long rad, long x, long y){\n        long dist = ((x - x1) * (x - x1) + (y - y1) * (y - y1));\n        long radius = rad * rad;\n        \n        return radius >= dist;\n    }\n}\n```
[]