Detonate the Maximum Bombs || Math || Graph || How to think of Graph || Leetcode 2101

In this video, I'll talk about how to solve the problem - Leetcode 2101. Detonate the Maximum Bombs
Problem Link: leetcode.com/problems/detonat...
C++/Java/Python Code & Notes: drive.google.com/file/d/1ii_a...
Detonate the Maximum Bombs || Math || Graph || How to think of Graph || Leetcode 2101
Let's Connect:
📝Linkedin: / aryan-mittal-0077
📸 Instagram: / aryan_mittal_007
📱Telegram : t.me/aryan_mittal_group
🤖 Github: github.com/aryan-0077
🛍️ Products I use in Videos: (✨ Marked for Mostly requested Products)
Main Camera (Canon 200D ii): amzn.to/41cfS5h
Vlog Camera (iphone 13): amzn.to/42aOJRh
Tripod for Lectures: amzn.to/3HMoloF
Tripod for Vlogs: amzn.to/44wGL6L
✨Mic: amzn.to/41bj8gU
Shadow Multi Colour Light: amzn.to/41bmIrq
Main Light: amzn.to/3LF6BNb
Tripod for Lights: amzn.to/3LFcQAt
Softbox for Lights: amzn.to/42mHqWE
✨My Pen Tablet for Notes: amzn.to/44A61ZJ
✨New Tablet for Notes: amzn.to/44BjTDa
Tablet Stand: amzn.to/3NMFIJR
Power Bank: amzn.to/421yHsZ
✨USB Hub: amzn.to/3p8NGTf
✨HardDisk to store Lectures: amzn.to/3HKafEs
✨My Laptop: amzn.to/44w12ct
✨My Monitor: amzn.to/3LCG6YL
My UPS: amzn.to/3Lydy2y
My UPS old: amzn.to/3LXT0C3
✨My Mouse: amzn.to/3LYmJdY
✨My Keyboard: amzn.to/3NJs4ah
Resources you can try:
Learn Coding: • Complete RoadMap for C...
🎥Channel Playlists
🎥 Baap Graph Series - by Aryan: • Baap Graph Series - by...
🎥Dynamic Programming: • Complete Dynamic Progr...
🎥Bit Manipulation: • Complete BIT MANIPULAT...
🎥Mathematics for DSA: • Complete Mathematics f...
🎥Leetcode Top Interview Questions: • FAANG & Leetcode Inter...
🎥Codeforces Problem B Ladder: • Complete PROBLEM B LAD...
🎥Codeforces Problem C Ladder: • Codeforces PROBLEM C L...
🎥Codeforces Problem D Ladder: • Complete PROBLEM D LAD...
🎥 Top 150 Interview Questions: • Top 150 Interview Ques...
🎥 Complete Array Problem Playlist: • Complete Array Intuit...
🎥 Complete Binary Search Problem Playlist: • Complete Binary Search...
🎥 Complete Stack Playlist: • Complete Stack & Queue...
🎥 Complete Graph Problem Playlist: • Complete Graph Intuiti...
🎥 Complete TREE Playlist: • Complete TREE Intuitio...
🎥 Complete DP Problem Solving: • Complete DP Intuition ...
🎥 Complete Linked List: • Complete Linked List I...
🎥 Complete Greedy Problem Playlist: • Complete Greedy Intui...
🎥 Complete Divide & Conquer Algorithm Playlist: • Complete Divide & Conq...
🎥 Complete Trie Playlist: • Complete Trie Intuitio...
🎥 Complete Mathematics & Number Theory Problems: • Complete Mathematics &...
About Channel:
We teach about how you can grow in life & educate about programming in Fun & Intuitional way.
About Me:
I am Aryan Mittal - a Software Engineer, Speaker, Creator & Educator. During my free time, I create programming education content on this channel & also how to use that to grow :)
✨ Timelines✨
0:00 - Problem Explanation
4:17 - Intuition
7:40 - Logic & Solution
11:03 - Code Explanation
✨ Hashtags ✨
#programming #Interviews #leetcode #faang #maang #datastructures #algorithms

[@ARYANMITTAL]

C++/Java/Python Code & Notes: drive.google.com/file/d/1ii_a9zN5r10KwyfG61BVPtMeb8Lakw4m/view?usp=sharing Were you able to figure out if it was a Graph Problem ?? If yes, then what triggered that intuition 🙈??

[@Mr.Potato23]

random exam question in pakistani college.

[@user-fv6et2qm7i]

Just amazing bro ❤❤

[@aorusgaming5441]

best

[@vaibhavchaubey8373]

your explanation is toooo good bro!

[@sanskarkumar7285]

very easy explanation. thanku sir

[@tejaswijadhav8031]

Nice explanation sir

[@user-fu4mw8no5t]

nice

[@rudrikasingh2892]

Great solution ! Though one doubt. Why in the java solution we are using an array to count number of visited states?

[@ce063_gautamlathiya5]

class Solution { private: void dfs(int node, vector adj, vector &vis, int &cnt){ vis[node] = 1; cnt++; for(auto i : adj[node]){ if(!vis[i]){ dfs(i,adj,vis,cnt); } } } public: int maximumDetonation(vector& bombs) { int n = bombs.size(); vector adj(n, vector()); for(int i = 0; i < n; i++){ for(int j = 0; j < n; j++){ if(i != j){ long long h = bombs[i][0], k = bombs[i][1], r = bombs[i][2]; long long x = bombs[j][0] - h, y = bombs[j][1] - k; if((x*x + y*y)

[@tejuschaturvedi6234]

pass adj by reference in parameters

[@harshal8781]

bro want a logic 🤗🤗

[@farnazzinnah8541]

not watching any other YT videos from now on. Only Aryan's videos. Because he taught me this hard concept in the easiest way possible. I don't think so anyone else can explain as good as him. Thanks man!

[@biswaMastAadmi]

zyada ho gya

[@ashishdhal4614]

Largest island problem with a bit of 8 grade math

[@summerkoushal679]

bro you always succeed to tell the visualisation of intuition, no one can do this good. You are a gem of a guy 🫀

[@PrajwalRaut]

Sir thoda Hindi mai bhi baate krte jau

[@VishalKumar-uk5uc]

Bhiya Hindi and English please

[@aditimahabole1761]

your explanation is toooo good bro!