Remove Max Number Of Edges To Keep Graph Fully Traversable | Leetcode - 1579 | DSU | GOOGLE | Live

Channel:

codestorywithMIK

Subscribers:

92,300

Published on April 30, 2023 4:28:47 PM ● Video Link: https://www.youtube.com/watch?v=8S5jpVM3kWw

Duration: 27:54

674 views

62

This is the 25th Video on our Graph Playlist.
In this video we will try to solve a Hard but a very good Graph problem "Remove Max Number of Edges to Keep Graph Fully Traversable" (Leetcode-1579).
I am promising you, this problem will become easy once you are done with this video.

If you have been following my "Graph Concepts & Qns" playlist , then these Qns will become very easy. Find the Link for that below.

Problem Name : Remove Max Number of Edges to Keep Graph Fully Traversable
Company Tags : GOOGLE
My solutions on Github : https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Graph/Disjoint%20Set/Remove%20Max%20Number%20of%20Edges%20to%20Keep%20Graph%20Fully%20Traversable.cpp
Leetcode Link : https://leetcode.com/problems/remove-max-number-of-edges-to-keep-graph-fully-traversable/


My Graph Concepts Playlist : https://youtu.be/5JGiZnr6B5w
My GitHub Repo for interview preparation : https://github.com/MAZHARMIK/Interview_DS_Algo
Subscribe to my channel : https://www.youtube.com/@codestorywithMIK

╔═╦╗╔╦╗╔═╦═╦╦╦╦╗╔═╗
║╚╣║║║╚╣╚╣╔╣╔╣║╚╣═╣
╠╗║╚╝║║╠╗║╚╣║║║║║═╣
╚═╩══╩═╩═╩═╩╝╚╩═╩═╝

#coding #helpajobseeker #easyrecipes #leetcode #leetcodequestionandanswers #leetcodesolution #leetcodedailychallenge #leetcodequestions #leetcodechallenge #hindi #india #hindiexplanation #hindiexplained #easyexplaination #interview #interviewtips
#interviewpreparation #interview_ds_algo #hinglish