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.
Dynamic Programming: Concepts to Code
·
Module 1
Foundations: State, Recurrence, and Evaluation Order
1
Identifying DP Problems
Characterize problems solvable by DP via optimal substructure and overlapping subproblems.
2
Dynamic Programming: State and Recurrence
Model a problem by defining its state representation and recurrence relation.
3
Memoization: Top-Down Dynamic Programming
Implement a top-down (memoized) solution based on a recurrence relation.
4
Tabulation and Topological Sort for Dynamic Programming
Implement a bottom-up (tabulated) solution, relating the evaluation order to a topological sort of the subproblem dependency graph.
Next module isn't ready yet,
Back to course
Previous module
Next module