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 Python programming
·
Module 6
Dynamic Programming Foundations
1
Dynamic Programming Suitability
Identify problems with optimal substructure and overlapping subproblems suitable for DP
2
DP Recurrence Relation Formulation
Formulate a DP recurrence relation for a given problem
3
Bottom-Up DP: Tabulation Method
Solve DP problems using a bottom-up (tabulation) approach
4
Dynamic Programming: Coin Change
Solve the coin change problem using dynamic programming
5
0/1 Knapsack with 2D Dynamic Programming
Solve the 0/1 knapsack problem using a 2D DP table
6
Longest Common Subsequence: A Dynamic Programming Approach
Solve the longest common subsequence problem using dynamic programming
Previous module
Recursion and Memoization
Next module
Backtracking