Union Find Introduction

Introduction to the Disjoint Set (Union find) data structure
Related Videos:
Union find intro: • Union Find Introduction
Union find kruskal's algorithm: • Union Find Kruskal's A...
Union find union and find: • Union Find - Union and...
Union find path compression: • Union Find Path Compre...
Union find code: • Union Find Code
Data Structures Source Code:
github.com/williamfiset/algor...
====================================
Practicing for interviews? I have used, and recommend `Cracking the Coding Interview` which got me a job at Google. Link on Amazon: amzn.to/3cvMof5
A lot of the content on this channel is inspired by the book `Competitive Programming` by Steven Halim which I frequently use as a resource and reference. Link on Amazon: amzn.to/3wC2nix ===================================
Practicing for interviews? I have used, and recommend `Cracking the Coding Interview` which got me a job at Google. Link on Amazon: amzn.to/3cvMof5
A lot of the content on this channel is inspired by the book `Competitive Programming` by Steven Halim which I frequently use as a resource and reference. Link on Amazon: amzn.to/3wC2nix

[@rainymondays7541]

the whole union-find playlist is very useful! tnx

[@tanmay-patil]

This playlist is awesome! The animations really made me understand union-find once and for all! Thank you for this @WilliamFiset

[@AbdelazizElHayyany]

4 years later... ?

[@nikhilraj1180]

William, you were the reason, I was able to understand the Union-Find so well, that I was able to code it perfectly, right after your explanation, w/o looking at the source. And by the way, I am dumb xD. Thank you so much William !

[@myeverymusic]

great video! very useful to point out how the Union Find algo can be used

[@diljitpr1764]

hi william, is there a page you maintain where i can practice problems on sites like kattis/codeforces after studying one concept?

[@ShivamPanchbhai]

I wish my algorithm professor was this clear in explaining algos, btw nice explanation than most of the paid courses out there

[@ngndnd]

i was taking the princeton D&A course on coursera and was confused af, but this video was so helpful. They didnt even explain what union find was or what its used for, i was so lost

[@chenjason2598]

very nice magnets example！

[@killahjon90]

how many "favorite" data structures do you have! lol

[@jerwinsamuel]

Haha :D

[@arnesh23]

Recursive!

[@user-oy4kf5wr8l]

hahahahahha

[@aditya234567]

2:35 magnet 2,3,4 are yellow group or orange???

[@frankd1156]

What software for animations is he using?

[@subee128]

Thank you very much

[@rishabhjain2404]

looking at the notation, shouldn't it be amortized linear time, instead of amortized constant time

[@WilliamFiset-videos]

Yes, that's a mistake in the slides.

[@thux2828]

α(n) is the inverse Ackerman function, so in theory not constant. However, it is such a slow growing function that practically speaking it may as well be constant. For α(n) to be greater than 4, n will exceed the number of subatomic particles in the universe!

[@midhurammanoj931]

Thank You

[@greyreynyn]

2:09 missed opportunity to merge 6 and 9 together (this is great tho)

[@darthvader_]

So far I'm crushing over tries. Let's see how I feel about Union Find

[@muskansinghal3685]

I have been trying to find tries video by William, but no luck. Can you please share the link ?

[@coop4476]

He's not Indian, he's not Indian!

[@krishshah3974]

lol

[@akshatbhutra7278]

magnet haha...

[@julielong6936]

It is an algorithm not data structure.

[@adorabledev]

Julie Long kinda both

[@charaiveticharaiveti8414]

Hmm.. Disjoint Sets Data Structure - Weighted Union and Collapsing Find. Disjoint sets may be used to represent nodes/vertices of non-connected and non-directed graph.