Loading repovive.com/roadmaps/graph-problem-solving
Roadmaps
Graph: Problem Solving
Premium
Shortest Path Variants
Problemset
Discussion
AI Helper
Getting Started
0/4
Shortest Path Variants
0/30
1
Introduction to Shortest Path Variants
2
What Shortest Path Variants Solve
3
When to Use Each Algorithm
4
State-Space BFS Pattern
5
Problem - Grid with Obstacles Elimination
6
Grid with Obstacles Elimination - Why Naive Fails
7
Grid with Obstacles Elimination - Defining the DP
8
Grid with Obstacles Elimination - Transition
9
Grid with Obstacles Elimination - Base Cases
10
Grid with Obstacles Elimination - Implementation
11
Grid with Obstacles Elimination - Time and Space
12
0-1 BFS - The Deque Trick
13
Min Cost Valid Path - Why 0-1 BFS?
14
Ways to Arrive - Counting Shortest Paths
15
Problem - Min Cost Valid Path
16
Min Cost Valid Path - Solution
17
Problem - Ways to Arrive
18
Ways to Arrive - Solution
19
Quiz: Pattern Recognition
20
Quiz: Edge Cases
21
Common Mistakes in Shortest Path
22
Problem - Reachable Nodes In Subdivided Graph
23
Reachable Nodes In Subdivided Graph - Solution
24
Problem - Shortest Path with Alternating Colors
25
Shortest Path with Alternating Colors - Solution
26
Problem - Shortest Path Visiting All Nodes
27
Shortest Path Visiting All Nodes - Solution
28
Problem - Minimum Weighted Subgraph
29
Minimum Weighted Subgraph - Solution
30
Section Recap
Grid Graphs
0/33
Connectivity (DSU and DFS)
0/27
DAG and Topological Sort
0/28
Tree Algorithms
0/39
Centroid Decomposition
0/30
2.1
Introduction to Shortest Path Variants
4 minutes
100%
Premium Roadmap
You're previewing free content. Unlock all units to continue learning.
Subscribe
Tasks
Read Unit