Skip to main content
Back to course
Log in
Get started
Someone wanted to learn this too, so Grasp built them a personal learning path.
Create your own
Remote Software Engineering Careers
ยท
Module 3
Advanced Algorithmic Patterns: Graphs and Trees
1
DFS for Tree Traversal: Recursive & Iterative Approaches
Implement recursive and iterative Depth-First Search (DFS) for tree pathfinding and validation problems.
2
BFS for Traversal and Shortest Path
Apply Breadth-First Search (BFS) for level-order traversal and finding the shortest path in unweighted graphs/trees.
3
Solving Graph Problems with DFS
Apply Depth-First Search (DFS) to solve graph problems like finding connected components and cycle detection.
4
Topological Sort for Scheduling and Dependencies
Implement the Topological Sort pattern to solve scheduling and dependency graph problems.
5
Recognizing DP Problems: Optimal Substructure & Overlapping Subproblems
Identify problems with optimal substructure and overlapping subproblems suitable for Dynamic Programming.
Previous module
Advanced Algorithmic Patterns: Heaps and Searching
Next module
Dynamic Programming and Interview Communication