Mst

2 articles

dsa9 min read

Prim's Algorithm — MST via Min-Heap Greedy Expansion [Google, Amazon, Microsoft]

Master Prim's algorithm for Minimum Spanning Tree: grow a single tree from any starting vertex by repeatedly attaching the cheapest crossing edge using a min-heap. The dense-graph counterpart to Kruskal, asked at Google, Amazon, and Microsoft.

March 19, 2026Read →

dsa8 min read

Minimum Cost to Connect All Points — Prim's MST on a Complete Graph [LC 1584, Amazon, Google]

Master LeetCode 1584 Min Cost to Connect All Points: model the n^2 implicit edges as a complete graph, then run Prim's MST in O(n^2) without ever materialising the edge list. A FAANG-favourite interview question at Amazon, Google, and Meta that tests whether you can spot a Minimum Spanning Tree behind a geometry prompt.

March 19, 2026Read →