G-46. Disjoint Set | Union by Rank | Union by Size | Path Compression

[@takeUforward]

Let's continue the habit of commenting “understood” if you got the entire video. Please give it a like too,. Do follow me on Instagram: striver_79

[@prem263]

Hi, During example explanation, you have mentioned to update parent of u or parent of v depending on rank of parent of u and v. but in code you are updating parent[ulp_u] which is parent of ultimate parent of u at 29:19. Can you please clarify why is this difference.

[@cartube6219]

java ka code likh k kya hi matlab , jab aap samjhate nhi , jesaa c++ ka code likhte ho vesaa live java ka likha rao app plz ,, c++ ka code side me chika diya karo , c++ community bahut badi hai , woh help leke manage kr lenge ,, but java walo ka kya ??

[@abhikantkumar8833]

​@@cartube6219 bro both java and c++ are almost same , there are only some minor syntax difference.

[@sudhanshushekhar4222]

Understood

[@abhinavgupta8839]

HIndi wala chiye solutions

[@crazyduniya128]

Me looking here nd there while video is playing, then suddenly I looked at the striver's face and found that he is more serious about my career then I myself. This motivated me and my focus boosted. Thank you striver. 🙏😌

[@YashMezzala]

cringe

[@humanity7880]

@@YashMezzala Okay Dank boi

[@valarmorghulis9244]

This was the toughest topic in Graph. So in case someone finds it difficult to understand while watching it for the first time. I suggest you to watch the next few videos and come back and do some brainstorming and then again see this video. I tell you this because it worked for me. And clearly no other videos have this depth explanation on KZbin. You will know how beautifully Striver has explained once the working of Disjoint Sets starts ticking your mind. Just watch some of the next videos and then come back and watch this.

[@lavanya_m01]

yes you're right, after watching the next few videos, it makes more sense. I also watched Tushar roy's video on Disjoint sets, it helped too :)

[@RahulPatel-hr4qe]

Yes ! Same happend with me in BFS and DFS , Intitally overwhelmed by it , came back after few days and back got it within one chancce

[@praveenkumarp7150]

Reading his article before this video will also help.

[@sohailshaik9]

Watching this video after watching Abdul Bari sir's video. Both are legends in their own way. Great learning ❤️

[@yashkagi5399]

i used to watch abdul bari's video for sleeping as his voice is very monotonous

[@vm1662]

Same! I just watched Abdul Bari sir's video and now watching Striver. These two are blessings to CS students.

[@movieskingdom1748]

Khud se bhi karle bhai..sirf video dekhne se kuch ni hota.

[@shubhamkumar-hx1fb]

​@@yashkagi5399😂

[@shubhamkumar-hx1fb]

​@@movieskingdom1748 khud se questions kiye jate Hain algos ke to videos hi dekhne padte hain 😂

[@AnushkaGupta-x6w]

This was the topic due to which I once got rejected at Google, And Now I can proudly say that this is the topic that is the reason that I got an offer from UBER 🎉🎉. THANKS STRIVER❤ Was a long journey but it was all worth it.

[@tiyashaghosh9933]

The more I see his videos, his work, the more I respect him.

[@KeigoEdits]

25:29 is such a wholesome reaction of striver lol, like a relative is giving you some money before leaving

[@cool.kunalsikri]

In college, i never did coding even though i was in Cse branch. Because i never liked competetive programming. But after coming into tech industry, i started liking to code and solve problems. So i have started learning various ds and i must say the content u have created is awesome. I love it .Awesome explanations . Thanks brother!

[@sameerakhatoon9508]

can you please lmk w/ which job you started?

[@varunaggarwal7126]

same with me.

[@musharrafhussain130]

systumm!

[@rollercoaster9719]

now the biggest qn is, how the hell did u get a job if u never did coding in college

[@shibainu7500]

@@rollercoaster9719 Aisa hi hota tha

[@arunimachakraborty1175]

This concept was quite complicated and you, as always, made it look so easy. Thanks a lot!

[@shubhiagarwal4047]

Understood. Striver Sir, this is great to launch dp and graph series. No teacher can do better dry run of the logic like you.

[@animeshmondal9569]

UnderStood Sir🔥🔥 No one can teach like you 😎😎..

[@AbhinavSingh-rl9zr]

wow literally blown my mind such depth of covering each point with intutition..,.massive amount of practice and hardwork is behind all this..

[@SoniaStalance]

Wow! That was one of the best tutorials I've ever seen.

[@sanyamjawlia]

Please bring such more series of other topics as well. These series are too amazing and easy to understand. Loved your way of teaching as well.

[@ashishkumaryadav5252]

Exceptional content on KZbin. Hats Off

[@shubhiagarwal4047]

Not a single dislike shows, a man with no hatred only respect.

[@jayyanthmalepati7584]

I did understood the class partially not fully but striver's videos have a good content .literally he is my trainer

[@g51661]

I wish I could hit the like button a thousand times! Thank you, Striver

[@kishorevb8331]

Knowing about the dynamic network connectivity problem really helps out as it is essentially the disjoint set algo is the same as weighted union with path compression

[@aparnakanchi]

Understood . Great to have people like you

[@mordor2594]

This is the first topic I had to refer some other resource to understand after your video. I love your content but this was the only time I had to go to some other place to understand the concept.

[@U2011-n7w]

your graph series is best on youtube

[@googleit2490]

Understood :) Have to code Sep'3, 2023 05:20 pm Done at Sep'4,2023 11:30 pm

[@AbhishekKumar-td5zu]

Best explanation of DisJointSet you will ever find ❤

[@vishious14]

THIS WAS THE BEST EXPLANATION OF DISJOINT SET. OMG !!!!!!!

[@anubhavjasoria4335]

Bhai love from odisha ….i have been following you since last year and i feel so confident about the topics that I learned from you ….. “ KEI DINA DEKHA HABA “ - my goal 😂😂

[@krishanpratap3286]

which year u at?

[@ashishdhal4614]

Bhai kou college

[@741ibrahim2]

Consistency is amazing ✨✨✨✨❤️‍🔥

[@sayakghosh5104]

One of the toughest topics in DSA, I've learned till now, DP was much easier. 🙂🙂🙂🙂🙂🙂

[@KeshavSingh-yu9jw]

Maybe you learned about disjoint joint first time today, It all comes down to practice. After some practice you will find it easier(that's the case with me). So lets keep grinding.

[@sayakghosh5104]

@@KeshavSingh-yu9jw yes today itself... Let's grind 😊

[@krishanpratap3286]

hey it will be easy once u solve some que with this / btw which year ?

[@sayakghosh5104]

@@krishanpratap3286 3rd Year. 🙂

[@KeshavSingh-yu9jw]

@@sayakghosh5104 I am in 3rd year as well.

[@atulkumarsingh6507]

I watched this video , when it got uploaded (2022) because it was the best at that time. I am watching this video right now (2024) because it is still the best .

[@Tbm4545]

And why u watching in 24 again?

[@kritikarawat2180]

Impressive man.I understood all concepts told in this video.

[@nishigandhagirishdandekar1131]

Very good explanation! I liked the union by size better than union by rank. It's more intuitive like you said in the video.

[@mayurbhor2231]

Learning Union By Rank first made Union by Size look easy and intuitive :)

[@prashantkumar-oz2in]

Now this is quality content.. ❤❤❤

[@vishalbindal5066]

Through this video i am able to understand dsu properly before this i go through various videos and articles but don't get it like after this video thanks bhaiya 🙂

[@mihirsaini592]

Watched it again after 5 months, can't thank you enough my man

[@utkarshsingh7197]

Teaching with such a fluency.....Big Fan Sir!!

[@uavishal777]

Striver bhaiya you are legend for us🔥🔥.i wish that anytime i could meet you.

[@mdsohrabakhtaremam9555]

great explanation help me to understand within few minutes at X2 speed, Instead of searching it over internet and spending lot of time.

[@cinime]

Understood! Such an awesome explanation as always, thank you very much!!

[@sarankumaar6009]

understood. best best best explanation. no one can match this ever

[@evilpollination1916]

As always amazing video. Understood everything but had to watch twice.

[@surabhilakhotia31]

Thank you sooo much for such detailed and simplified explanation :)

[@shitizgoel5027]

Very nice explanation for union-find algorithm. Thank you very much bhaiya! 🙂

[@mayurbhor2231]

If you ware wondering what is α(n) is , It is Ackerman's function constant . α(1)=1 𝛼(1012)=4 𝛼(265536)=5 The function grows very slowly , and for all practical applications we can consider it as constant

[@21BD1A05R]

I find union by rank more intuitive because, without path compression ( i,e, if findPar is not called for any of the nodes ) we can assume rank as the depth of the tree. As Striver mentioned, attaching a smaller depth tree to a larger depth tree is more efficient, and this makes logical sense. In contrast, union by size doesn't provide a clear idea about the tree's depth. When using union by size, we are assuming that a larger size corresponds to a greater depth, which isn't necessarily true in all cases. I would like you to comment your intuition .

[@Schrodinger-xd4pv]

true bud

[@Dontpushyour_luck]

This was such a nice video. Thank you for teaching all this for free!

[@AbhilashKumar-x2k]

What an explanation. Hats off🫡

[@suryasingh2563]

UnderStood bhaiya...thankYOu soo much

[@Malmo308]

Very nice video! Everything was explained clearly. Thank you very much!

[@Ballistic_Bytes]

Brilliant explanation. Loved it.

[@sohammukherjee1392]

24:16 that finding parent technique via backtracking was nearly similar to print shortest path using Dijkstra's algorithm where we're using that parent array

[@oqant0424]

No one can teach like you!

[@AlokSingh-jw8fr]

Understood everything you taught in video.

[@vijayarana2087]

Thanks for creating this video, wonderful explanation

[@ddevarapaga5134]

Best video for disjoint set.

[@raghavmanish24]

thanku striver for making such difficult topic so interesting

[@itspurelypassionate]

Thank you! This is is the best explanation of Disjoint Set I've come across. By the way I have a request for one other video. Can you please upload a video explaining leetcode 992 problem. I tried to understand through other channels but I didn't get it. The problem asks us to find the number of subarrays with exact K different integers. Thanks!

[@rohitn6333]

Thanks for this wonderful explanation sir

[@augustinradjou3909]

Astonishing work!

[@paragroy5359]

Thanks a lot for making such videos it is really helpful. Great Content

[@viraag8667]

You made this topic look very easy thanks

[@udaytewary3809]

Understood bhaiya 🙏❤️

[@shantipriya370]

just wow.. superb explanation..

[@vigupta-uq1pn]

goldmine for DSA🔥🔥

[@vaishnavimore4860]

Great explanation🚀 understood!!

[@virgarg9653]

Understood Very good bro keep it up .....

[@vikashkumarvlogsnitj]

impressed , subscribed at first video itself.

[@saniyapathan8968]

You are the best🙌

[@amitp277]

What a detailed explanation 👏👏

[@shauryatomer1058]

As always great video. Thanks for the awesome content

[@SachinKumar-zs6hm]

Understood! Thanks a lot Striver.

[@sobujkhan2602]

this is amazing application really very nice video

[@adityasood04]

25:30 Keep it 1 was epic😂

[@kb-ru4md]

Best videos dp and graph🙏

[@AyushEditz-hs6pf]

damn , you made it look so easy. Thanks Striver

[@reshusingh3558]

Understood sir ,thankyou for your support.

[@Stellar_7x]

In our university they only taught algorithms of krushkals and prims and dijkstras and in psudo code they just wrote union and gave 0 knowledge about union ...... THEY THINK THAT WE'RE THE GENIUS THAT WE FIGURE IT OUT ON OUR OWN LOL ! , aap knowledge to dete hi ho sath mai degree bhi dene lago ......

[@Tbm4545]

They don't think we are genius they themselves don't know how to explain and some even dont have knowledge about that, they just come and teach u what is important for ur sem exams and done

[@amanbhadani8840]

Striver Bhaiya op 🥳

[@achyutpal6225]

Understood very well. Thank you 😄😄😄😄😄😄,

[@nazibur175]

Very good explanation!

[@herculean6748]

lots of love and respect🙌

[@sunilpanchal1498]

As always great explanation 🙂

[@adebisisheriff159]

Amazing content as always!!!!

[@az-zm4ji]

union by size starts at 35:00

[@Shubham_gupta18]

best of all !! kudos to you bro

[@garimagupta4208]

great video & explanation

[@abhishekkuntare4640]

Understood all the stuffs ❤❤

[@gangsta_coder_12]

Understood 🔥🔥

[@oqant0424]

UnderStood Sir🔥🔥

[@vaibhavsharmaiiitu9319]

Amazing video loved it

[@prathmeshadsod629]

So the difference between connected components and strongly connected component is in strong connected component Graph is directed and every node is reachable to another node . In connected compo. we just need somehow they are connected. Am I right ?

[@shubhamraj25]

I guess yes till what we have studied in this lecture

[@Yash-uk8ib]

only difference is the nature of graph and applicablity of DSU. SCC, as u mentioned will only found if graph is directed and cyclic, DSU cannot be applied here. Component is just a few nodes connected in a group. A component can be a SCC.

[@ritwikamahapatra1432]

what an explanation! THANKYOU

[@devchaudhary5002]

Fantastic explanation! thanks a lot my man

[@shubhrabrahmachari7649]

you inspired me today . Thank you

[@rushidesai2836]

Very well explained!

[@codingid5470]

Wow such clear explanation!

[@arnavumarkar8259]

Very well explained. Thanks

[@sanchitsrivastav453]

now I am satisfied with the logic and code

[@ebukaegbunam8716]

ultimate teacher

[@TanmayShimpi]

you have my respect buddy.