DSU - ua-cam.com/video/AsAdKHkITBQ/v-deo.htmlsi=KIFBRgFo35-2-Vb7 DSU By Rank and Path Compression - ua-cam.com/video/iH3XVIVzl7M/v-deo.htmlsi=WExx9fFGcCHPVmzw DSU By Size and Path Compression - ua-cam.com/video/kGv33AiGhdc/v-deo.htmlsi=ubpr2mPS-yWIzKGG Thank you all
@@dipalisharma4682 how to do continously as we are not getting results early we have to do dsa dialy for 1 to 2 years and also development any suggestions how to do dialy
bhaiya topmate session kab loge ? i need it i left dsa in between from 1.5 month i use to code daily along with u . myself shreyash i use to comment daily but i feel lost but now want to start again just need your guidance once. plzz bhaiya max 10-15 min call with u
bhaiya any suggestion i am i third year felling nervous and tension and now i am thinking to aim for tcs digital or prime i am not feeling confident of cracking other companies since i dont have any friends i may not clear OA but in tcs only aptitude and little bit of coding so what u suggest bhaiya
Hi Jatin, Have you studied DSU ? If Not, I will suggest you to watch my DSU video, then this will become easy ❤️❤️ ua-cam.com/video/AsAdKHkITBQ/v-deo.htmlsi=1pZjPgkBWMqfM20n
bro ek cheez ko baar baar explain ere ho na toh confusion aur increase kerte ho tum!! just explain the solution and move on!! News nhi chl rhi jo baar baar same cheez ko repeat kerte rehte ho
Hi dev, I appreciate your feedback. Thank you and I will definitely try to work in this. I usually repeat for the sake for super beginners. Thanks ❤️❤️
You can easily skip the part which you know, there is no need for this comment, jayada dimag khrb hota h to khud solve kia kr. He is not making vedios just for you. He is the best person I know so far jiski explanation or code same hoti h. When I approached this ques I initially thought of djikstra's algo, then I thought in djisktra's you can't visit the edge multiple times means it will not be part of the shortest path. I admit I didn't give much time to solve this question, after very minutes I jump to this vedio, but I was not thinking of DSU or & operation at all. This vedio made me realize that really fundamentals are everything. I request @codestorywithMIK to not change the way you are teaching and please ignore these types of comments.
bro..u can skip the part you already know...mik's explanation is for beginners who have difficulty in understanding...I request mik not to change your teaching style
DSU - ua-cam.com/video/AsAdKHkITBQ/v-deo.htmlsi=KIFBRgFo35-2-Vb7
DSU By Rank and Path Compression - ua-cam.com/video/iH3XVIVzl7M/v-deo.htmlsi=WExx9fFGcCHPVmzw
DSU By Size and Path Compression - ua-cam.com/video/kGv33AiGhdc/v-deo.htmlsi=ubpr2mPS-yWIzKGG
Thank you all
Bhaiya , I got the placement Thank you ❤
Congratulations 🎉
Many Congratulations 😇🥳🥳🥳🎉🎉🎉enjoy
Company name ??
Your way of explanation is really Awesome....great respect sir
Great video 👌🏻
Good explanation 🎉❤
I am confused when a node is connected to another node via 3-4 direct routes, how to have intuition for that?
Amazing explanation
Thanks A lot ❤❤
I write Union_by_size but it don't work on some test case !!
Why??
did you understand why union by size didn't work ?
bhaiya gfg k bhi potd bnaya kro naa
Sunday mana dene do bhai sir ko 😂
jokes apart, do you also solve GFG POTD and Leetcode POTD daily ?
Is that helpful ? SHould I also start
@@EB-ot8uu Yeah I have started and it helps
@@dipalisharma4682 how to do continously as we are not getting results early we have to do dsa dialy for 1 to 2 years and also development any suggestions how to do dialy
@@dipalisharma4682 same it helps
5 = 00000101
-1 = 11111111
-------------------------------
AND = 00000101
bhaiya topmate session kab loge ?
i need it i left dsa in between from 1.5 month i use to code daily along with u . myself shreyash i use to comment daily but i feel lost but now want to start again just need your guidance once.
plzz bhaiya max 10-15 min call with u
Bro make BIT MANIPULATION playlist soon 🙏😎
bhaiya any suggestion i am i third year felling nervous and tension and now i am thinking to aim for tcs digital or prime i am not feeling confident of cracking other companies since i dont have any friends i may not clear OA but in tcs only aptitude and little bit of coding so what u suggest bhaiya
Please go through this Guide video once - it will help you get started on how to study - ua-cam.com/video/2Jshfog1ETg/v-deo.htmlsi=sFf3YDaBGfWmJBm8
bhai upar se gya bhai bhai ye bilkul smjh ni aya kya kru
Hi Jatin,
Have you studied DSU ?
If Not, I will suggest you to watch my DSU video, then this will become easy ❤️❤️
ua-cam.com/video/AsAdKHkITBQ/v-deo.htmlsi=1pZjPgkBWMqfM20n
First view
bro ek cheez ko baar baar explain ere ho na toh confusion aur increase kerte ho tum!! just explain the solution and move on!! News nhi chl rhi jo baar baar same cheez ko repeat kerte rehte ho
Hi dev,
I appreciate your feedback. Thank you and I will definitely try to work in this. I usually repeat for the sake for super beginners.
Thanks ❤️❤️
Sorry , if I was rude,
Just dimaag kharab ho gya tha
Hope you understand ❤
You can easily skip the part which you know, there is no need for this comment, jayada dimag khrb hota h to khud solve kia kr. He is not making vedios just for you. He is the best person I know so far jiski explanation or code same hoti h.
When I approached this ques I initially thought of djikstra's algo, then I thought in djisktra's you can't visit the edge multiple times means it will not be part of the shortest path. I admit I didn't give much time to solve this question, after very minutes I jump to this vedio, but I was not thinking of DSU or & operation at all. This vedio made me realize that really fundamentals are everything.
I request @codestorywithMIK to not change the way you are teaching and please ignore these types of comments.
@@devmadaan5146 Bhai nhi padhna to mat padh bhai
Skip kar de uss part ko
bro..u can skip the part you already know...mik's explanation is for beginners who have difficulty in understanding...I request mik not to change your teaching style
class Solution {
public:
vectorparent;
vectorrank;
int find(int x){
if(x==parent[x]){
return x;
}
return parent[x]=find(parent[x]);
}
void Union(int x,int y){
int x_par=find(x);
int y_par=find(y);
if(x_par==y_par)return;
if(rank[x_par]>rank[y_par]){
parent[y_par]=x_par;
}else if(rank[x_par]