Loading repovive.com/roadmaps/graph-problem-solving
Roadmaps
Graph: Problem Solving
Premium
Grid Graphs
Problemset
Discussion
AI Helper
Getting Started
0/4
Shortest Path Variants
0/30
Grid Graphs
0/33
1
Introduction to Grid Graphs
2
What Grid Problems Solve
3
When to Use Grid Techniques
4
Multi-Source BFS Pattern
5
Problem - Get All Keys
6
Get All Keys - Why Naive Fails
7
Get All Keys - Defining the State
8
Get All Keys - Transition
9
Get All Keys - Base Cases
10
Get All Keys - Implementation
11
Get All Keys - Time and Space
12
Problem - Pacific Atlantic
13
Pacific Atlantic - Why Naive Fails
14
Pacific Atlantic - Defining the Approach
15
Pacific Atlantic - Core Logic
16
Pacific Atlantic - Implementation
17
Problem - Surrounded Regions
18
Surrounded Regions - Why Naive Fails
19
Surrounded Regions - Defining the Approach
20
Surrounded Regions - Core Logic
21
Surrounded Regions - Implementation
22
Boundary DFS Pattern
23
Problem - Shortest Bridge
24
Shortest Bridge - Solution
25
Shortest Bridge - Why This Works
26
Quiz: Grid Pattern Recognition
27
Quiz: Boundary Techniques
28
Common Mistakes in Grid Graphs
29
Problem - Minimum Moves with Rotations
30
Minimum Moves with Rotations - Solution
31
Problem - Escape the Spreading Fire
32
Escape the Spreading Fire - Solution
33
Section Recap
Connectivity (DSU and DFS)
0/27
DAG and Topological Sort
0/28
Tree Algorithms
0/39
Centroid Decomposition
0/30
3.1
Introduction to Grid Graphs
4 minutes
100%
Premium Roadmap
You're previewing free content. Unlock all units to continue learning.
Subscribe
Tasks
Read Unit