Skip to main content
grasp.study
About
Explore
Pricing
Log in
Try it for free
Back to course
👋
Welcome to a Grasp lesson
Create a free account
to keep studying and create your own study path.
Learn widely used algorithms
·
Module 9
Advanced Algorithmic Patterns
1
Topological Sort: Kahn's Algorithm & DFS
Perform topological sorting on a directed acyclic graph (DAG) using Kahn's algorithm or DFS.
2
Floyd-Warshall Algorithm for All-Pairs Shortest Paths
Compute all-pairs shortest paths using the Floyd-Warshall algorithm.
3
DP on DAGs: Topological Sort Applications
Formulate and solve DP problems on DAGs by processing vertices in topological order.
4
Tree Dynamic Programming Fundamentals
Describe how to approach DP problems on trees (e.g., maximum path sum).
5
Dynamic Programming vs. Greedy vs. Divide & Conquer
Distinguish when a problem requires DP versus a greedy or divide and conquer approach.
Previous module
Classic Dynamic Programming Applications
Next module
Solving Problems with Backtracking