PROBLEMS/ADVANCED GRAPHS/MINIMUM SPANNING TREE (PRIM'S / KRUSKAL'S)

Minimum Spanning Tree (Prim's / Kruskal's) Problems

5 Minimum Spanning Tree (Prim's / Kruskal's) problems on LeetCode, a Advanced Graphs interview pattern, ranked by importance (how often it comes up in real interviews). Difficulty (ELO) and importance shown per problem.

#	PROBLEM	DIFF	ELO	IMP	PATTERNS
1	Connecting Cities With Minimum CostPREMIUM	Medium	1753	82	Union-Find
2	Min Cost to Connect All Points	Hard	1858	82	Union-Find
3	Optimize Water Distribution in a VillagePREMIUM	Hard	2069	62	Union-Find
4	Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree	Hard	2572	62	Union-Find · Sorting + Comparison
5	Maximize Spanning Tree Stability with Upgrades	Hard	2301	40	Binary Search on Answer Space · Union-Find

MORE ADVANCED GRAPHS PATTERNS

Dijkstra's (Weighted Shortest Path)Minimum Spanning Tree (Prim's / Kruskal's)

// your mastery

What's your Minimum Spanning Tree (Prim's / Kruskal's) tier?

leaps.gg syncs your LeetCode history, scores your Minimum Spanning Tree (Prim's / Kruskal's) mastery, and recommends exactly which problems to do next with spaced repetition. Free to start.

GET MY MASTERY MAP →