Min Cost to Connect All Points | Prim's Algorithm | META | Graph Concepts & Qns - 35 | Leetcode-1584

[@aakashbhargava1]

Being a youtube student and preparing DSA from many channels I can surely say that your channel is the best, the way of teaching and the efforts and the best thing is that you make the most complicated topics the easiest, today you have 6.01K subscribers but soon they will more than 600K because of the quality content you provide, thank you sir lots of respect

[@codestorywithMIK]

You made my day Aakash. Thank you so much ❤️🙏😇

[@DivVj]

Agree with Akash!

[@mantenapragnyabala1711]

Hi.can you suggest from where to learn trees

[@SaurabhSinghyadav-r4y]

People says Graph is the hardest part of data structure untill they find this Playlist. Thank you so much sir , I'm following this Playlist and almost at its end .

[@codestorywithMIK]

You are most welcome ♥️

[@AbhijeetMuneshwar]

Respected MIK Sir, This video shows how useful concepts those you teach in "Graph Concepts" playlist are. It's like you're teaching us formulae which can be used to solve multiple mathematical questions. Huge respect 🙏🙇

[@wearevacationuncoverers]

This playlist is the best Graph playlist. I can binge watch anything this guy creates

[@Silly_My_name]

This playlist has improve my problem solving skill as well my consistency. I am not more consistence that ever. I am solving problem each no matter what.

[@codestorywithMIK]

So glad to hear 😇🙏

[@peter9759]

Bhai theory samajh ke khudh hi code likh diya thanks dry run was the crucial part for me

[@codestorywithMIK]

❤️❤️❤️

[@oqant0424]

u made it a cakewalk ......literally. Thanks

[@anujkumar-pb6eb]

Solved by myself because of last video explanation. Thank you MIK

[@ugcwithaddi]

Today’s POTD done. Thank you legend ❤

[@sahilgarg94]

Very underrated channel.

[@codestorywithMIK]

Thank you so much 😇😇❤️❤️

[@sumitgupta310]

done code without watching video , thank you bhaiya !!!!!!!!!!!!!!

[@dayashankarlakhotia4943]

One day this chanel become most popular channel on dsa

[@codestorywithMIK]

Hope so 🥹 Thank you so much Daya 🙏

[@jagadeeshp1163]

Ek Number

[@codestorywithMIK]

Thanks a lot ❤️❤️

[@codestorywithMIK]

Today’s POTD - kzbin.info/www/bejne/h3rYanubrqqdhsUsi=N7C15PELOKP0UjDS

[@kishan.17]

Always consistent ❤

[@prateekmohanty8315]

Bhaiya I such love the way you teach , after I have seen your channel whenever I have any doubt in any question I just straight go to yt and search your channel , and let me tell you many people from my college are seeing your videos , this is just an indication of how big this channel is going to be in the coming years Just one small request bhaiya it woule be great if you could post leetcode contest problems as well

[@codestorywithMIK]

You made my day. Thank you so much 😇❤️🙏 Sure, i will soon start contests also

[@prateekmohanty8315]

@@codestorywithMIK thank you so much bhaiya

[@JoyAcharyatvl]

It was aweosme . Thanks.

[@codestorywithMIK]

Most welcome 😊

[@codestorywithMIK]

Today’s POTD - kzbin.info/www/bejne/h3rYanubrqqdhsUsi=N7C15PELOKP0UjDS

[@shabananoor9423]

Best explanation

[@oqant0424]

35/41 DONE [10.12.23]✅✅

[@souravjoshi2293]

I will repeat "KING of GRAPHS"

[@ugcwithaddi]

Legend ❤

[@divyanshsagar]

Awesome!

[@codestorywithMIK]

Thanks a lot 😇🙏❤️

[@dayashankarlakhotia4943]

Kruskal's algorithm. class solution { public int min cost connected points(int [][]points){ int n=points. length; Priority queue pq= new Priority queue ((a,b)-->a[0]-b[0]); for (int i=0;i

[@daayush6654]

Bhaiya said weekend par aayega toh aayega 🙏🏻

[@taneyasoni]

15/30

[@codestorywithMIK]

Today’s POTD - kzbin.info/www/bejne/h3rYanubrqqdhsUsi=N7C15PELOKP0UjDS

[@dayashankarlakhotia4943]

Prim's algorithm. class solution { Public int min cost connect points ( int [][]points){ Priority queue pq=new Priority queue ((a,b)-->a[0]-b[0]);int res=0, connected =0.i=0,n=points. length; boolean []visited =new boolean [n]; while (++connected

[@umeshbisht1054]

Thanku bhaiya ❤ Bhaiya adj banane Kai liye DSU use kar sakte hai kay

[@debjitmisra8223]

1st❤❤

[@FARMAAN2001]

Kaise ho bhai

[@codeandtalk6]

❤

[@SHIVAMOJHA21]

can't we use dijkstra's algo?

[@codestorywithMIK]

You can use Dijkstra’s too.

[@kartikforwork]

@@codestorywithMIK how?? we don't have source,

[@Abhay14]

bhaiya aapne yha adj as a vector of vector kyun k=liya unordered map kyun nhi liya

[@codestorywithMIK]

You can take unordered map as well.

[@Abhay14]

bhai ye error de rha h :no member named 'push_back' adj[i].push_back({j, weight}); adj[j].push_back({i, weight}); unordered_mapadj(n) isko lagane pr @@codestorywithMIK

[@AmarjeetKumar-to9ub]

🔥++

[@codestorywithMIK]

Thanks a lot ❤️❤️

[@codestorywithMIK]

Today’s POTD - kzbin.info/www/bejne/h3rYanubrqqdhsUsi=N7C15PELOKP0UjDS

[@oqant0424]

Motivation in the start 🔥🔥🥹

[@B-Billy]

5:24, This has cycle. It is not even a valid Tree. and you mentioned that every MST must be a valid Tree. Please correct me. Thanks for the video.

[@atifakhtar8828]

bhai aagr mera selection ho gaya to aap mujhe lollipop khila dena kyunki aapki9 wajah se hua hai

[@B-Billy]

14:37 Interviewer : O(n3) is too much, can you do it O(n) Candidate :

[@gauravbanerjee2898]

35/40 done ✅ thanks a lot bhaiya❤🥹