Kruskal's Algorithm | Minimum Spanning Tree | Full Dry Run | INTUITION | Graph Concepts & Qns - 36

[@kishan.17]

Congratulations for 6k ,love u bro ❤,and may God bless u for teaching soo many people and helping them , and pls be making videos ❤

[@codestorywithMIK]

Thank you so much Kishan. Means a lot. Definitely i will keep making videos ❤️❤️❤️❤️

[@oqant0424]

U made Kruskal......a HALWA..........i mean seriously ........now I can write the code as well as tell the intuition of Kruskal even in my sleep. All thanks to u

[@thekindspill]

This playlist is a GOLD. Most underrated graph playlist ever seen

[@chiragsingh8323]

Pls dont stop giving bhasan❤ Absolutely love this🔥 Each video i watch there is constant motivation and life lessons to learn. Also pls make concepts videos for other topics too along with interview problems that u r already making..pls make concept videos too it will be helpful for others

[@codestorywithMIK]

Thank you so much 😀 Sure thing 😇🙏❤️

[@sanjaykatta6499]

DSU, Prims, Kruskals never realised that these algos were this simple until I found your playlist. I owe you a lot sir!

[@shubhamjaiswal7645]

according to me...this was the best video till now in this playlist ...literally enjoyed so much ...thank you so much

[@gaurimandot5788]

Seen your journey from 700 to 70k and excited to see it from 70k to 700k. Thanks bhaiya for making things so simple and fun !!❤

[@codestorywithMIK]

This means a lot Thank you so much 😇🙏

[@pankajkashyap2892]

For sorting there is no need of writing lambda expression as we can put {w,u,v} then call inbuilt sort function that will sort based on first value w. This was just by observation. I always love the way you explain.

[@codestorywithMIK]

Disjoint Set Union - kzbin.info/www/bejne/d6SklX5-oK6HeLM Disjoint Set Union By Rank and Path Compression - kzbin.info/www/bejne/n3mWiYl_i9-fba8

[@wearevacationuncoverers]

Congratulations for 6k. You deserve it

[@souravjoshi2293]

Congratulations for 6k Subscribers bro. You are gonna break all records soon. Thank you so much

[@itsanuragjoshi]

@codestorywithMIK, In Kruskal's algo, we can use min-heap (priority queue) to efficiently select edges with smallest weights without need for sorting a vector array. This approach can improve efficiency of algo, especially for graphs with a large number of edges.

[@darkstudio3170]

bhai starting ka jo bhasan h usko sunkar mja aa jata h😅

[@codestorywithMIK]

😇🙏❤️

[@dayashankarlakhotia4943]

Your channel is growing. Congratulations

[@codestorywithMIK]

Thank you so much ❤️😇🙏

[@gauravbanerjee2898]

36/40 done ✅ thanks a lot bhaiya❤✌

[@AlishaKhan-ww3io]

Thanku bhaiya ❤ you are best

[@umeshbisht1054]

Thanku bhaiya ❤

[@kritikasingh4876]

Bhaiya jldi complete krne ka kosis kariye graph and trees bohat accha padhate ho aap

[@mohitjain5783]

sir I am loving your videos, can you make videos like pattern recognition questions which solve different types of question which cover maximum type of question comgratulations of 6 k ❤

[@codestorywithMIK]

Thanks a lot 😊❤️ Sure

[@crashcartjoe6783]

bhaiya vector me simply aise push kar denge vec.push_back({w,v,u}); to comparator ka jarurat nhi padega

[@harsh.jain22]

One doubt, when we are already given the vector

[@AlishaKhan-ww3io]

you can sort that as well. However, generally sometimes in interview, they don't allow to modify the original array.

[@sanjaykatta6499]

We can do it by using priority queue also. static int spanningTree(int V, int E, int edges[][]) { // Code Here. PriorityQueue pq = new PriorityQueue(Comparator.comparingInt(a -> a[2])); for (int[] edge : edges) { pq.add(edge); } parent = new int[V]; rank = new int[V]; for (int i = 0; i < V; i++) parent[i] = i; int sum = 0; while (!pq.isEmpty()) { int[] poll = pq.poll(); int u = poll[0]; int v = poll[1]; int w = poll[2]; if (find(u) != find(v)) { union(u, v); sum += w; } } return sum; }

[@oqant0424]

36/41 done [11.12.23] ✅✅

[@Abhay14]

bhai ye jo compare funtion h sort ke andr uska syntax samjha do

[@codestorywithMIK]

Sure. Let me soon add a video on that

[@kakaji6470]

Why not we used min_heap concept ??

[@manishv.8167]

How many more videos are left in graph concept playlist??

[@codestorywithMIK]

Two major ones is left only - 1) Strongly Connected Components (SCC) - Kosaraju’s Algo 2) Articulation Point Once done, will only post interview problems and explanations on Graphs Playlist. Let me know any other topic if left.

[@souravjoshi2293]

@@codestorywithMIK Thank you. Please also cover the qn "Alien Dictionary"

[@ugcwithaddi]

DSU by size

[@--Blood--Prince--]

Sir ye comparator kya hai nhi samjha 18:18

[@codeandtalk6]

❤❤

[@deshmukhsaurav4020]

sir please upload the solution of today's leetcode problem

[@codestorywithMIK]

Hi there, it was uploaded many months ago. This is the link - kzbin.info/www/bejne/bmLLaYJjZbpopdE

[@deshmukhsaurav4020]

@@codestorywithMIK ​ @codestorywithMIK thank you sir...!

[@codestorywithMIK]

Hope it helps 😇❤️

[@dhairyachauhan6622]

Sry bro if my comments are spammed 😅.I don't know they disappear after i comment

[@codestorywithMIK]

Hi Dhairya, sorry to hear that. Can you try again your comment in this thread ? Let’s see if it comes this time. I don’t know why KZbin does that 🥹

[@dhairyachauhan6622]

@@codestorywithMIK if i add links it deletes the comment 801. Minimum Swaps To Make Sequences Increasing Just wanted to say if you get time please cover this question too 🥲.It really hard to understand

[@codestorywithMIK]

@dhairyachauhan6622 yes sometimes youtube removes the link not sure why. Sure, noted, will cover this soon