Disjoint Set Union Fundamentals | Union Find | Small to Large merging | Part 1

We will cover Disjoint Set Union's Advanced ideas soon, however, building the basics clearly is very important. Watch it to build a clear conceptual understanding of the ideas.
Do share with your friends who are doing CP besides you / Are preparing for internships and placements.
✨ Hashtags ✨
#VivekGupta #Competititve #CPStreams #codechef #codeforces #engineering #internship
-------------------------------------------------------------------------------------------------------------
If you are a beginner, here are some resources to start with :
✅ Free Language course with certificate that i taught - bit.ly/3I52EAb
✅ More free courses - bit.ly/3SKoCNO
If you are looking to train in a commado like regime for acing DSA (with DEV and System Design covered for placement too), do checkout :
🔴 bit.ly/3SKoM7S
If you want to connect over social media or want more resources : linktr.ee/vive...

[@vivekgupta3484]

Do like and subscribe to support creating more such content. Also feel free to suggest/discuss more stuff on this series :D

[@Go_Golang]

Bhai ye video playlist me add nhiye .. krdo

[@Go_Golang]

Our bich bich me hindi bola kro hum convent medium se nhi hai ... Toh link break ho jati hai lecture se bich bich me

[@vivekgupta3484]

@@Go_Golang Mai CP wala content english me hi rakhne ki kosish karta hu... but i understand.

[@Why_I_am_a_theist]

amazing content, yt needs more educators than self-promoters. Keep up the good work

[@pranshukashyap6848]

Very Well Explained! Also, Please do add some links to good educational problems (5-6) after the video to practice, it would be helpful for those who are beginner and learning for the first time !

[@aarushiaiyyar]

You are gifted teacher! Thanks for sharing your knowledge with the world! Go AZ!

[@Hydra_cody]

video - audio lagging for all ??? or its only for me..

[@Ramu9119]

same problem

[@adityagaur2223]

best teacher ever

[@srishtikdutta8946]

Persistent segment trees please or the idea of persistent data structures in general.

[@jeevansingh5170]

Thanks for this series

[@codingwithanonymous890]

sir please make videos on dp on trees and graphs...ur explanation is so good

[@TECHADVICETEAM]

Super excited for this

[@Star-xk5jp]

thank you vivek😀

[@abhigaikwad6328]

it should be swap(rootx,rooty) right?

[@vivekgupta3484]

Absolutely. Thanks for the correction. Good to see that you watched and understood the things in detail.

[@priyanshsinghal11]

I too was going to say that

[@priyanshsinghal11]

@@vivekgupta3484 one question, if rank(height) of both trees are same, wouldnt the height of combination be same. ( Then we should not have done rank[rootx]++ ?)
Oh while typing out the question, i realized why is it happening. Nevermind thanks. Got it.( Thats why you say write comments)

[@vivekgupta3484]

@@priyanshsinghal11 absolutely... when you write things to explain, things become 10x more clearer for you.

[@ezhilarasi2823]

Bhaiya please make videos on segment and Fenwick trees also

[@vivekgupta3484]

Ya, segment tree idea summary is something that i am planning to make after this DSU series

[@meetbrahmbhatt1531]

@@vivekgupta3484 yes please
Your content is very good and informative

[@rishabhsaxena3279]

When we are using size instead of rank , then rank(size) should be initialize with rank[i] = 1;(line 41)?? Or I am missing something.?

[@vivekgupta3484]

Both 0 and 1 works for rank_by_height. Its just like 1 indexing or 0 indexing of height. But when we are using by_size (at end), it should be made 1.

[@ornatetrout]

48:13
A small correction in unite function()
it should not be swap(x, y)
it should be swap(rootx, rooty)
I know in live lecture these things happens, and the main thing is concept, but I thought it would be better to mention this.

[@vivekgupta3484]

Thanks for pointing this out :D