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:
Telegram channel: telegram.me/realanujbhaiya
Telegram group: telegram.me/dsa_one
🚀 Follow me on:
Instagram: / anuj.kumar.sharma
Linkedin: / sharma-kumar-anuj
Twitter: / realanujbhaiya
💸 Use coupon code ANUJBHAIYA on GeeksforGeeks to avail discounts on courses!
📚 Complete DSA Playlist: • DSA-One Course - The C...
Complete Android Development Playlist: • Android Development Tu...
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++

[@redeye4170]

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

[@onepercentbetter3313]

Wow superb please provide some guidance on the same

[@onepercentbetter3313]

If you don't mind

[@somrawat4280]

Bhai referal de da

[@HackShield_girl]

Brother could you please send my refferal at Amazon bcoz my college is coming in 3 tier college so that's why I'm requesting you please reffer my resume

[@aarshp]

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

[@ayushuniyal2586]

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

[@prathmeshsanjayraonikam3016]

Thanks Anuj Bhaiya!!! Next level explaination.

[@sarthakchauhan8386]

You're a blessing bhaiya.

[@rohan8758]

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.

[@mohdshadab7338]

very very good explanation bhaiyya .....

[@Ankit.yt_885]

Very good explanation! Well done

[@ashu3128]

Very Good Explanation,thanks😊

[@trainingbulls9069]

very good and easy explaination, thank you bhaiya

[@harry-cf4ii]

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

[@Isha_Sethi]

yes!

[@TackleGaming]

Love you bhaiya ❣️ Aap ko

[@user-oz2eu7rs8v]

Great explanation

[@rushabhajain3977]

Great explanation sir :)

[@rohitvishwakarma9261]

Nice explanation!

[@raviyadav2552]

simple and easy for implementation

[@CgTutorials99]

Mast tha bhai ye

[@NikhilSingh-ty9qs]

thankq bhaiya🙏

[@hackstreet781]

good work

[@devanshtripathi2603]

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 money.....kya ap is dsa course ko aage continue krenge?if possible isko please band mat kriyega mere jaise logo ke liye ye course amrit hai

[@alliswell3805]

Love you bhaiya

[@ramakrishnakcr4417]

thank you

[@chandraveersingh5561]

Hi bhaiya!

[@shubhamprajapati8240]

Nice function acronyms

[@muteddwrt6937]

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

[@ridelikeguru]

Sir kruskals algorithm kab ayega ?

[@Prototype.abdullah]

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

[@abhishekupadhyay7505]

First💯💯

[@rahulvast2612]

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

[@kevalkrishna4134]

thnx a lot ,helped me in understanding kruskals algorithm .

[@saritaprasad4295]

DSA fine

[@onepercentbetter3313]

When can we expect system design videos?

[@vimalkumardubey6834]

Well explained bhaiya ❤️✨

[@mindbehaviour9195]

🤯

[@souravsaha933]

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

[@arunyadav7467]

Jaldi jaldi video upload karo bhai please please 🙏

[@chandraveersingh5561]

1

[@SauravSingh-gx5rm]

Bhaiya total kitne lectures hoge?

[@avtaar3041]

aap sikhte kaha se ho ? please ispe video bnao

[@mainwhihoon]

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

[@sameerakhatoon9508]

ofc

[@wolfgaming8690]

when got stuck in any DSA concept i came here

[@shadabalam8550]

Sir please koi python ka accha course btaiye Jo basic to advance level ka ho please please

[@gamerglobe4839]

help why this code is not submitting even all the conditions are same? class GfG { int rank[]=new int[1000001]; int find(int A[],int X) { if(A[X]==X) return X; return find(A,A[X]); } void unionSet(int A[],int X,int Z) { int a=find(A,X); int b=find(A,Z); if(a==b) return; if(rank[a]

[@aishwaryshukla8880]

gfg is saying that parent of Z should become the parent of X. so instead of writing A[b]=a; in your code, write A[a]=b; The following code works although it doesn't implement rank: class GfG { int find(int A[],int X){ //add code here. if(A[X] == X){ return X; } return find(A, A[X]); } void unionSet(int A[],int X,int Z) { //add code here. int xRoot = find(A, X), yRoot = find(A, Z); if (xRoot == yRoot)return; else{ A[xRoot] = yRoot; } } }

[@dss963]

I don't think path compression makes any sense , because as we find parent of two nodes in an edge , we are already setting represntative element being the parent of any node being connected to that component.

[@reapercreeper6097]

No we are not setting it as parent of node connected to that component, we are just setting it as it's immediate parent

[@shadabalam8550]

Any people tell me python course basic to advance level please

[@AnujBhaiya]

Hi Shadab, We have Python in One video which is a good place to start learning Python. For More Advanced concepts, You can refer to the FreeCodeCamp KZbin channel.

[@shadabalam8550]

@@AnujBhaiya Sir I see your course complete but I think not advance level

[@kaptaindeveloper7800]

Bhaiya aap shaadi kab karoge?

[@AnujBhaiya]

It'll get done in the next month.

[@shrutipant7864]

Cleverly edited :D

[@anoridinaryhumanbeing70]

DISGUSTING! XD

[@vaibhavtale318]

@@AnujBhaiya really !!!