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

preview_player
Показать описание
In this video, I have shown you such a code snippet, which can solve any problem on Disjoint Set on any platform.

In case you are thinking to buy courses, please check below:

---------------------------------------------------------------------------------------------------------------------------
Рекомендации по теме
Комментарии
Автор

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

takeUforward
Автор

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. 🙏😌

crazyduniya
Автор

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

sohailshaik
Автор

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 Youtube. 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.

valarmorghulis
Автор

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!

cool.kunalsikri
Автор

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

tiyashaghosh
Автор

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

KeigoEdits
Автор

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

AbhinavSingh-rlzr
Автор

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

animeshmondal
Автор

Best explanation of DisJointSet you will ever find ❤

AbhishekKumar-tdzu
Автор

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

SoniaStalance
Автор

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

sayakghosh
Автор

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

arunimachakraborty
Автор

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

jayyanthmalepati
Автор

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

kishorevb
Автор

Exceptional content on YouTube. Hats Off

ashishkumaryadav
Автор

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

shubhiagarwal
Автор

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.

sanyamjawlia
Автор

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 😂😂

anubhavjasoria
Автор

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 🙂

vishalbindal