NeetCode 150 · Minimum Spanning Tree (Prim's/Kruskal's)
Build a minimum-weight tree connecting all nodes, either by growing from a frontier (Prim's) or sorting edges and using union-find (Kruskal's).
Sheet Problems: 1
Category: Graphs
ℹ
Curated selection from NeetCode 150
This sheet features 1 problem testing this technique. For the complete collection of problems and detailed algorithmic intuition, visit the Minimum Spanning Tree (Prim's/Kruskal's) Pattern Guide.
Featured Problems (1)
Explore More Patterns in NeetCode 150
Track your progress across all 150 problems in this curriculum roadmap.