Union Find Algorithm | Disjoint Set | Union By Rank & Path Compression | DSA-One Course #84

Hey guys, In this video, We're going to learn about the Disjoint Set Data Structure.
The partitioning of the individuals into different sets according to the groups in which they fall. This method is known as a disjoint set data structure which maintains a collection of disjoint sets and each set is represented by its representative which is one of its members.

🥳 Join our Telegram Community:

🚀 Follow me on:

💸 Use coupon code ANUJBHAIYA on GeeksforGeeks to avail discounts on courses!

Hashtags:
#anujbhaiya #dsaone

Tags:

union find
union find algorithm
disjoint set union
disjoint set data structure
disjoint set
anuj bhaiya
disjoint sets
union by rank
union find data structure
anuj bhaiya java
disjoint set manipulation
anuj bhaiya dsa
union-find data structure
disjoint set operation
disjoint sets in daa
dsu
kruskal algorithm
union and find algorithms
union and find operation in daa
union by rank and path compression
union-find
anuj bhai
bellman ford algorithm
code with harry
codehelp
data structure
dsa java
dsa playlist
dsp anuj bhaiya
dsu graph
find and union
flask tutorial
java anuj bhaiya
java dsa
passportjs
path compression
rotten oranges leetcode
set and disjoint set union
set data structure
sets and disjoint set union in daa
tree in dsa
union
union and find
union and find algorithm
union find gfg
union set
union-find gfg
disjoint set in coding
disjoin set code java
union find java c++

[redeye]

@Anuj Bhaiya thanks you for this course, finally got placed in Amazon, got a lot of things from this course.

[aarshp]

Was not able to understand after watching a lot of videos. you explained it really well. Thank you so mach

[ayushuniyal]

u are gem of dsa, DIAMOND.
waiting of backtracking .

[harry-cfii]

Bhaiya when is the DSA one course ending?🙏🔥pls provide a expected timeline so that we can plan accordingly.

[prathmeshsanjayraonikam]

Thanks Anuj Bhaiya!!! Next level explaination.

[muteddwrt]

Anuj bhaiya please make videos on Dynamic Programming and Greedy Algorithm.

[rohan]

Great explanation bhaiyan, By the way how much time it took to you learn DSA with 300-500 pratice problems on hackerrank GFG, Leetcode etc plaforms.

[Prototype.abdullah]

This algorithm is most mind bang but some concept understanding and some out of mind last path compression

[devanshtripathi]

hello bhaiya i have finally completed this course till this video but you recently announced a paid course on dsa which is not possible for me to afford because i am short of ap is dsa course ko aage continue krenge?if possible isko please band mat kriyega mere jaise logo ke liye ye course amrit hai

[kevalkrishna]

thnx a lot, helped me in understanding kruskals algorithm .

[rahulvast]

You also need to reduce rank of previous parent in find operation when performing path compression

[trainingbulls]

very good and easy explaination, thank you bhaiya

[arunyadav]

Jaldi jaldi video upload karo bhai please please 🙏

[onepercentbetter]

When can we expect system design videos?

[mainwhihoon]

Don't we need to update the ranks after doing path compression?

[souravsaha]

Bhaiya kohi UI + backend mixed one projects video banao na 🙂

[DHRUVSANGAL-el]

at time 14:17, on line 35 and 38, the operators you have put are wrong, they should be opposite of what they currently are