1579. Remove Max Number of Edges to Keep Graph Fully Traversable || Union Find || DSU || Graph
In this video, I'll talk about how to solve - 1579. Remove Max Number of Edges to Keep Graph Fully Traversable
To Understand Union-Find (DSU) code Deeply: • Checking Existence of ...
Problem Link: leetcode.com/problems/remove-...
C++/Java/Python Code & Notes: drive.google.com/file/d/1FPg_...
Minimum Cost of a Path With Special Roads || Union Find || Disjoint Set Union || DSU || Graph
Let's Connect:
📝Linkedin: / aryan-mittal-0077
📸 Instagram: / aryan_mittal_007
📱Telegram : t.me/aryan_mittal_group
🤖 Github: github.com/aryan-0077
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 &...
🎥 Faang Interview Questions & Solutions: • Playlist
🎥 Google Interview Questions: • Google Interview Quest...
🎥 Microsoft Interview Questions: • Microsoft Interview Qu...
🎥 Amazon Interview Questions: • Amazon Interview Quest...
🎥 Meta Interview Questions: • Meta Interview Questio...
🎥 Apple Interview Questions: • Apple Interview Questi...
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✨
✨ Hashtags ✨
#programming #Interviews #leetcode #faang #maang #datastructures #algorithms
Пікірлер: 14
C++/Java/Python Code & Notes:
I tried to code it by myself, without looking at any solution approaches or hints or anything remotely like that. But I had to come here for your video at last when my code had passed 84/85 test cases. Dil ka dard bayaan nahi kar sakta main.
your explainations was very good and really help me to understand the approach, one suggestion is that you could try to calm or maintain you body language which is anoying
DSU was very intuitive and I was able to solve it easily using it
One suggetion for you don't move your hand or your body to much it create disturbance other wise content is next level.
You uploaded a video each day this month. Helped a lot. Thanks and keep up the good work!
why for type =3 we are dsu of alice only shouldn't we check for both
The best explanation 👍
Great ❤
Greetings,
Hello Aryan I have a doubt, I tried to check if graph was traversable by Alice and Bob by seeing if number of i's in parent array such that parent[i] == i is equal to 1 or not. I hypothesized that if graph is traversable, then it must contain only one parent[i] such that parent[i] == i. But apparently there was a test case where there only existed one such i in parent[i] for both Alice and Bob such that parent[i] == i; but graph was not traversable by both/one of them; so my code was giving wrong answer where it should have rather given ans as -1. Any help please? Thanks for this channel btw love your videos.