PROBLEMS/ADVANCED GRAPHS

Advanced Graphs LeetCode Problems

40 hand-tagged Advanced Graphs problems across 2 interview patterns (Dijkstra's (Weighted Shortest Path), Minimum Spanning Tree (Prim's / Kruskal's)), ranked by importance (how often each pattern shows up in real coding interviews). Work top-down within each pattern.

Dijkstra's (Weighted Shortest Path)

35 problems →

#	PROBLEM	DIFF	ELO	IMP	PATTERNS
1	Network Delay Time	Medium	1566	88	Heap Simulation
2	Cheapest Flights Within K Stops	Medium	1786	82	BFS Shortest Path (Unweighted) · Linear Recurrence DP
3	Path With Minimum Effort	Hard	1948	78	Binary Search on Answer Space · Union-Find
4	Swim in Rising Water	Hard	2097	78	Binary Search on Answer Space · Union-Find
5	Find the Closest Marked NodePREMIUM	Medium	1432	72

+ 30 more Dijkstra's (Weighted Shortest Path) problems →

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

5 problems →

#	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

EVERY PATTERN

Arrays & Hashing Two Pointers Stack Binary Search Sliding Window Linked List Trees Tries Backtracking Heap / Priority Queue Graphs Core DP Intervals Greedy Advanced Graphs Advanced DP Bit Manipulation Math & Geometry

// your mastery

What's your Advanced Graphs tier?

leaps.gg syncs your LeetCode history and scores your mastery of every pattern, then recommends the exact problems to do next with spaced repetition. Free to start.

GET MY MASTERY MAP →