It literally feels illegal to watch this good quality explanations for free, amazing explanation. DSU clear💪, please continue this playlist sir and solve medium-hard leetcode qs on graphs, waiting to learn from you❤
Dude, I seriously can't believe I am solving DSU topic. I am able to understand. Now I know that anything is possible to be understood, we just need a good tutorial. And you are just the perfect one who made this possible I want to thank you from the bottom of my heart ❤
Same bro, earlier even I use to leave these kind of topics thinking its too advanced. Thanks @codestorywithMIK bro, saying this from the bottom of my heart.
Respected MIK Sir, I was scared of Graph Algorithms before watching this video. But Now I'm feeling confident about them after watching this video. Thank you so much for delivering this High Quality Content for FREE. 🙏🏼🙇🏼♂️
Thank you so much, sir. Your explanation method is outstanding. I tried 2-3 times to understand this concept on a paid course platform, but I found it really tough to understand. So, thank you so much. Hats off to you, sir 👏❤
You are literally legend bhaiya really hats off 👏 you explain such a difficult concept in such a easy way we can't even imagine and for this we will always greatful to you ❤️ 💖 💛 💙 💗 💕
Sure. Let me plan this very soon because you are right, this is indeed very important. I will upload the road map video asap Thanks a lot for your precious feedback
@@codestorywithMIK Please bhaiya , try to upload it soon , because I am very confused , I know you have very hectic routine ( JOB + daily leetcode problem video ) , but please it will clarify the path to be followed
Sir, I have a doubt in Union Function In the If condition you said if(x_parent != y_parent){ parent [x_parent] = y_parent; } Isn't it should be parent[x] = y; ?? according to the changes we made in the parent vector in the example.
@@codestorywithMIK I saw your LinkedIn Profile. I'm also from Hazaribagh. Studied in DAV Public School. You are an awesome teacher. I messaged you on linkedin.
ARE YOU FOR REAL!!?? I LOVE YOUR STORIES😭😭 and stay motivated for coding bcz of you!!! Thankyou 🤧❤
He is exceptional
This guy is a legend. I feel lucky I got this channel
Legend
Who else here after today's LeetCode POTD Remove Max Number of Edges to Keep Graph fully Traversable? Amazing explanation Sir
I watched 3 times DSU from Striver but didnt understand this bcaz he was not shown us basic for path compression ,you are best Mik Bhaiya
It literally feels illegal to watch this good quality explanations for free, amazing explanation. DSU clear💪, please continue this playlist sir and solve medium-hard leetcode qs on graphs, waiting to learn from you❤
True man
paise bej de bhai inko..
oh my god !! why cant we find so much good teachers in our institutes and colleges.
keep doing the job brother
Thanks a lot Yash ❤️❤️❤️
This playlist has changed everything 🙏🏻. No more Graph nightmares ❤️❤️
It's the best graph playlist I have ever seen♥️
Thanks a lot. More videos coming soon ❤️❤️❤️
Dude, I seriously can't believe I am solving DSU topic.
I am able to understand. Now I know that anything is possible to be understood, we just need a good tutorial. And you are just the perfect one who made this possible
I want to thank you from the bottom of my heart
❤
Same bro, earlier even I use to leave these kind of topics thinking its too advanced. Thanks @codestorywithMIK bro, saying this from the bottom of my heart.
Tum bahot mast kaam karta hai maqsood bhai! 🙌🙌🥹
😄❤️😇🙏 Thank you Ashish
good explanation
Respected MIK Sir,
I was scared of Graph Algorithms before watching this video.
But Now I'm feeling confident about them after watching this video.
Thank you so much for delivering this High Quality Content for FREE.
🙏🏼🙇🏼♂️
❤️❤️🙏🙏😇
You are just outstanding. My fear of Graph, DSU etc is gone just because of you. The legend and king of graphs
Best !! Graph playlist ever made in India
Lovely...today's Leetcode Daily question is based on this! ❤
Indeed
Thank you so much
Just pause the adblocker for your videos , by seeing your way explanation
bhai kya samjya ho aap , dsu , alag level i didnt knew itna assan tha. thanks man
You made the concept very clear 😊
Glad to hear that 😇
Thank you so much, sir. Your explanation method is outstanding. I tried 2-3 times to understand this concept on a paid course platform, but I found it really tough to understand. So, thank you so much. Hats off to you, sir 👏❤
bhai tu goat hain bhai :)
Bahut sahi hai bhai 😂
You are literally legend bhaiya really hats off 👏 you explain such a difficult concept in such a easy way we can't even imagine and for this we will always greatful to you ❤️ 💖 💛 💙 💗 💕
amazing story!!
thank you bhai! waiting for the next
Only mature programmer know that Array problems are harder and more tricky than graph, DP.
mann hats off !! literally it was too easy to understand
Thank you so much Viya.I see a lot of videos about this topic but this video is something special for me.
🙏🙏❤️❤️
You are most welcome
🔥🔥
Unreal explaination, is graph even tough after seeing this playlist??
Glad it helped 😊
nice explanation
18/40 done ✅ thanks a lot bhaiya😊❣
Thank you 😇🙏
Best sir ❤
badiyaa bhai loved it
Qualcomm
sir, bohot acha explanation tha❤
I keep repeating. YOU ARE A LEGEND ❣
Excellent explanation!
❤️❤️❤️ Tysm Manash
u removed the fear of DSU ...............🥲
Thank u so much 💖
Glad to hear that 😇🙏❤️
You're the best bhaiya ❤️
And so are you guys ❤️😇🙏
Awesomeeee...
BEST
thanks man 👌👌👌👌
You are a magician ❤❤❤
waiting for dlc🙂
Hey MIK, can you also make 1 roadmap video for DSA like what should be the exact structure and path from basic topics to advanced dsa?
Yes please. Must needed
Sure.
Let me plan this very soon because you are right, this is indeed very important.
I will upload the road map video asap
Thanks a lot for your precious feedback
@@codestorywithMIK Please bhaiya , try to upload it soon , because I am very confused , I know you have very hectic routine ( JOB + daily leetcode problem video ) , but please it will clarify the path to be followed
Waiting for today's leetcode
Sir, I have a doubt in Union Function
In the If condition you said
if(x_parent != y_parent){
parent [x_parent] = y_parent;
}
Isn't it should be parent[x] = y; ?? according to the changes we made in the parent vector in the example.
sir pls make more videos on dsu questions.
Soon ❤️
18/41 done [6.11.23]
bro after writing algo try to implement it in a testcase
nice use of "mai baap". Bhaiya aap jharkhand se ho na?
Yes 😅
@@codestorywithMIK I saw your LinkedIn Profile. I'm also from Hazaribagh. Studied in DAV Public School. You are an awesome teacher. I messaged you on linkedin.
So happy to know this ❤️❤️
I get very less time to check my DMs on insta or LinkedIn, i might have missed your msg. Glad you reached out here
swad😎
baiya jbb recording kiya kro then guided access on kr diya kro
Sure thing.
Noted. Thank you so much for the feedback Abhay ❤️❤️
You dont upload leetcode contest solution?
Not yet. Planning soon 😇
@@codestorywithMIK Yes please do, especially the fourth question is almost impossible to understand from others' solution
@@girikgarg8 indeed
@@Anonymous____________A721 now i left :(
Today leetcode daily challenge explaination bhayya??
Coming soon.
Ensuring people are aware of DSU first.
😊
Don’t worry, it will come today
A little delay. Apologies