Graph Theory - Study Plan - LeetCode
Graph Theory - Study Plan - LeetCode
A graph consists of an unordered set of vertices and edges that connect some subset of the vertices. The
edges may be directed (only traversable in one direction), undirected, weighted (having... Expand
Graph Theory II
Easy Medium Hard 1 / 21
Graph T… 0 0 0 day
0 26 27
Day 1 Union Find
261. Graph Valid Tree Medium
Depth-First Search Breadth-First Search Union Find Graph
Acceptance 46.4% Start Now
684. Redundant Connection Medium
Depth-First Search Breadth-First Search Union Find Graph
Acceptance 61.7% Start Now
Day 2 Union Find
685. Redundant Connection II Hard
Depth-First Search Breadth-First Search Union Find Graph
Acceptance 34.0% Locked
1579. Remove Max Number of Edges to Keep Graph Fully Traversable Hard
Union Find Graph
Acceptance 52.1% Locked
Day 3 Union Find
1101. The Earliest Moment When Everyone Become Friends Medium
Array Union Find
https://leetcode.com/study-plan/graph/?progress=bg8s7a2 1/8
30/07/2022, 13:00 Graph Theory - Study Plan - LeetCode
https://leetcode.com/study-plan/graph/?progress=bg8s7a2 2/8
30/07/2022, 13:00 Graph Theory - Study Plan - LeetCode
1489. Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree Hard
Union Find Graph Sorting Minimum Spanning Tree
Acceptance 53.1% Locked
Day 14 Shortest Path
787. Cheapest Flights Within K Stops Medium
Dynamic Programming Depth-First Search Breadth-First Search Graph
Acceptance 35.9% Locked
1631. Path With Minimum Effort Medium
Array Binary Search Depth-First Search Breadth-First Search Union Find
Acceptance 55.2% Locked
1514. Path with Maximum Probability Medium
Graph Heap (Priority Queue) Shortest Path
Acceptance 47.7% Locked
Day 15 Shortest Path
1928. Minimum Cost to Reach Destination in Time Hard
Dynamic Programming Graph
Acceptance 37.7% Locked
1368. Minimum Cost to Make at Least One Valid Path in a Grid Hard
Array Breadth-First Search Graph Heap (Priority Queue) Matrix
Acceptance 61.1% Locked
743. Network Delay Time Medium
Depth-First Search Breadth-First Search Graph Heap (Priority Queue)
Acceptance 50.8% Locked
Day 16 Shortest Path
505. The Maze II Medium
Depth-First Search Breadth-First Search Graph Heap (Priority Queue)
Acceptance 51.7% Locked
499. The Maze III Hard
Depth-First Search Breadth-First Search Graph Heap (Priority Queue)
https://leetcode.com/study-plan/graph/?progress=bg8s7a2 5/8
30/07/2022, 13:00 Graph Theory - Study Plan - LeetCode
Featured Lists
Top Interview Questions
Top 100 Liked Questions
Top Facebook Questions
Top Google Questions
Top Amazon Questions
LeetCode Curated Algo 170
https://leetcode.com/study-plan/graph/?progress=bg8s7a2 7/8
30/07/2022, 13:00 Graph Theory - Study Plan - LeetCode
Top Microsoft Questions
LeetCode Curated SQL 70
https://leetcode.com/study-plan/graph/?progress=bg8s7a2 8/8