Disjoint Set Union By Rank and Path Compression - | DSU | Graph Concepts & Qns -19| Explanation+Code

Channel:

codestorywithMIK

Subscribers:

92,300

Published on January 15, 2023 2:28:47 PM ● Video Link: https://www.youtube.com/watch?v=iH3XVIVzl7M

Duration: 22:09

691 views

50

Hi Everyone, this is the 19th video of our Playlist "Graph Concepts & Qns".
In video-18, we understood a very important topic in Graph "Disjoint Set Union (DSU)"
In this video we will see the optimized version of DSU using Rank and Path Compression.


Problem Name : Disjoint Set Union By Rank and Path Compression
Topic : Graph
Video : 19
Company Tags : Google, Facebook, Apple, Amazon, Netflix, Flipkart


My GitHub Repo for interview preparation : https://github.com/MAZHARMIK/Interview_DS_Algo
Subscribe to my channel : https://www.youtube.com/@codestorywithMIK

0:00 - Intro & Recap
1:20 - Understanding Path Compression from Example
8:12 - find() using Path Compression
10:04 - Understanding Rank from Example
12:55 - Why Larger Rank is chosen as Parent
17:04 - union() using Rank

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

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