1.12 Disjoint Sets Data Structure - Weighted Union and Collapsing Find 

Why someone. Why not you

​@@ytg6663😂

​@@omkarkasle3058🙂

its true man..

i totally agree w/u

do you have audit of that DSA course right now ?

This person is so good at teaching..

Thanku

Good job bro♥️😇

25:25 Final disjoint set

13:59 hinting at weighted union

Thank you ❤️ so much

Is it general or c++

teach me master Agway

It Is Now

knowledge gate only

but this is also awesome but not the best

Knowledge Gate all at max in Hindi, But These are in English. Everyone doesn't know Hindi seems(even for me).

@@sensei.0909 🙂

Rone wala kya hai isme

Iam curious,Where r u from ?

I love it when he says "so what we do" Best teacher ever!

I love him😜

like sanchit sir in knowledge gate

but disliking is wrong.he is awesome.

They think it is download button

@@Anuragsinghkashyap sanchit teaches everything but this guy has mastery in this field

@@Faust1386 bro lol

You're very welcome!

Same here :)

Sir u can teach code also for these concepts

@@abdul_bari sir just a question..I am a self taught programmer..so is this series complete for someone like me?

Lol. Proofs and theory are really essential. Especially for this Data structure one should understand the proof for time complexity. He always skips the tough part and explains the easy one.

@@xiquandong1183 Can u tell me the tough parts...i am a beginner and would love to know what are refering to? ....ty...and also should i learn All the Data structures before learning algorithms(i know array,strings,LL,stacks and queues)??

Nice. Bro

Hiiii😎

Same confusion for me too...

Hey, I had the same confusion. The only think I can think of is keeping track of an edge set. As you're adding in edges you would check whether that edge already exists I suppose. If it does, then you basically do nothing.

Another way to think of this is that, for a given set say {1,2,3,4} the number of elements (nodes) must be less than the number of edges if want to avoid a cycle. So if we have {1,2,3,4} and we have created 3 edges, the moment we want to add another edge, regardless of what the two nodes involve are (whether {1,2} {1,3} {2,3} {2,4} e.t.c) that 4th edge would lead to a cycle

He is truly the BEST teacher out there for DSA, but... "If both nodes are in the same set then we have found a cycle" - This is absolutely FALSE statement in the video. I think what he is trying to say is - "If we try to perform this new union, where both are already in same set then it WILL form a cycle (future tense)" - Even though that also does not make true sense to me. Am sure, the theory, examples etc in the video are accurate, but the statements are lost in English translation and is so confusing. I watched the video 3 times and still cannot make any logical sense of the cycle explanation, unless I just do rote learning and accept it. IMO, it would have been better if they showed a real input, instead of the diagram (since algos dont take diagram as input, it was even harder to understand if he is forming a Set from a graph, or creating a graph from a Set). Sigh :(

😂

I don't think so. 2 is still connected to 1, so we have both 2 and 5 connected to 1 individually. Collapsing just helps with decreasing the number of comparisons.