C++,BFS Easy to Understand.
Approach:-For Every Bomb We will Check how many others Bombs Lies inside it and how many Bombs lies inside the bomb which Lies inside Checking Bomb and this wil
**Approach**:-For Every Bomb We will Check how many others Bombs Lies inside it and how many Bombs lies inside the bomb which Lies inside Checking Bomb and this will Go on.\n-->This will be done with the help of **BFS.**\n-->We will return the bomb which will cover Maximum number of Bombs..\n```\n#define ll long long int\nclass Solution {\npublic:\n    ll BFS(vector<vector<int>>& bombs,int i)\n    {\n        vector<bool>visited(bombs.size(),0);\n        queue<int>q;\n        q.push(i);\n        visited[i]=true;\n        ll count=1;\n        int n=visited.size();\n        while(!q.empty())\n        {\n            int idx=q.front();\n            q.pop();\n            ll x=bombs[idx][0];\n            ll y=bombs[idx][1];\n            ll r=bombs[idx][2];\n            \n            for(int k=0;k<n;k++)\n            {\n                if(visited[k]==1) continue;\n                \n                ll x1=bombs[k][0];\n                ll y1=bombs[k][1];\n                \n                ll dist=(x-x1)*(x-x1)+(y-y1)*(y-y1); //Distance btween center.\n                \n                if(dist<=r*r) //Check whaether it Lies inside it or not (condition that Point Lies inside a circle)\n                    count++,visited[k]=1,q.push(k); //If yes Mark as Visited ,increase Count and Push in queue.\n            }\n        }\n        \n        return count;\n    }\n    int maximumDetonation(vector<vector<int>>& bombs) {\n        ll ans=1,n=bombs.size();\n        vector<bool>visited(n,0);\n        for(int i=0;i<n;i++)\n        {\n            /*For every Bomb Check how many Bomb we can detonate.\n            -->Use BFS to Check*/\n                ans=max(ans,BFS(bombs,i)); \n        }\n        \n        return (int)ans;\n    }\n};\n```\n*If you find it helpful, please upvote.*
['Breadth-First Search']