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.
Data Structures and Algorithms
·
Module 10
Dynamic Programming
1
Recognizing DP Problems
Identify problems with optimal substructure and overlapping subproblems suitable for DP.
2
Memoization to Tabulation (Bottom-Up DP)
Convert a recursive, memoized solution into a bottom-up, tabulated DP solution.
3
1D Dynamic Programming: Climbing Stairs & House Robber
Solve 1D DP problems such as Climbing Stairs and House Robber.
4
Solving 2D Dynamic Programming Problems
Solve 2D DP problems such as Longest Common Subsequence and Edit Distance.
5
Knapsack Problems with DP
Solve knapsack-style problems (0/1 and Unbounded) using DP.
6
Dynamic Programming for Coin Change
Solve coin change problems using dynamic programming.
Previous module
Recursion and Backtracking
Next module
Graph Traversal Algorithms