Thanks a lot for you consistent videos. Merry Christmas and Happy New Year to You and your family. 😇 Just a request if you could also add some series on Leetcode Daily challenge problem or may be random leetcode problems based on any topics. Hope Santa make this true.😇
could we have just maintained a visited array, and after adding a vertex , we will just mark the 2 vertices connected by the new edge as visited...and every time we add a new edge we will check if the 2 vertices that are going to be connected are both visited or not..
Great video for the MST and Marry Christmas and happy new year to you.
best graph playlist........❤❤❤
Thank you for the course!!
Also, 💚
Very nice n clear explanation and nice class room set up👌
Sab samajh aa gya guru ! 💛💛🙏
Thanks a lot for you consistent videos. Merry Christmas and Happy New Year to You and your family. 😇
Just a request if you could also add some series on Leetcode Daily challenge problem or may be random leetcode problems based on any topics.
Hope Santa make this true.😇
Isme hum visited array maintain krke easily check kr sakte ki do alag alg tree ka part hai ki Nahi??
if i use a isvisit vector to check if the two nodes are inserted of not will it work alternative to dsu?
maza aagaya💚💚💚
Thank you sir💛
Nice Hair Cut. After so long XD
💛 Loved It 💛
Many many Thanks. Sir..
thankyouuuu🙇♀🙇♀🙇♀
Merry Christmas bhai ❤
Sir need roadmap for devops??
This channel will reach 2M subscribers in 2 years.
Never as this channel is now dead as course is completed
@@ashpreetsinghanand7260 Once his video become popular he will come back. It's same with almost every UA-camr.
💚This was fun. Will u be covering segment trees too?
no
Alright
For segment tree you can either refer to prateek narang webinar or take you forward channel.
@@iamluv bring the next version of this course now. It's needed indeed.
vector
vector edges
Keep a space in each of the ending right angles
💛Thank You💛
100k soon ❤️
could we have just maintained a visited array, and after adding a vertex , we will just mark the 2 vertices connected by the new edge as visited...and every time we add a new edge we will check if the 2 vertices that are going to be connected are both visited or not..
not really, note the point that a single vertex can participate in many edges.
@@amishdevgan9942 yes but what if we add an edge only if both of the vertex aren't visited and in all other cases skip adding the edge
Thankyou sir
💚 Helpful!
Bro after this will you start dp ?
Hutiye pehle ye toh khtm kr le
undersrated
New year pr bhai ka 100k
Need segment tree videos. Please upload segment tree lecture.
Why &edge?
To avoid making copies
Hello Sir,
I am just very curious to know, up till when DP videos could be completed, if everything goes as per the plan?
Btw nice explanations!!!
20 days approx
🔥
very nice
next video will be awesome 💚
💚💚💚💚💚💚💚💚💚💚💚💚💚💚💚💚💚💚
❤️
💚💚💚💚💚💚💚💚💚💚
Keep it up
nice bro
bhai prims bhi samjha do please
💚💚💚💚💚
jaangh faad video
Cool
💛
mereko algouniversity me pucha tha isse bhi hard quest
❤️❤️❤️
Play button kab aayega😁
💚
💚💚
💙
💛💚💛💚
bro tries pdhAo
mera examhai 27 jan ko
💚💚💚
♥️
💚💚💚💚
💛
💚
💖
💛
💚💚💚💚💚
💚💚
💚
💛
💚💚
💚
💚💚💚
💚
💛💛💛
💚💚
💚
💚💚
💚
💚
💚💚
💚
💚💚
💚
💚
💚
💚
💚
💚
💚
💚
💚
💚
💚
💚
💚
💚
💚
💚
💚
💚
💚
💚
💚
💚
💚