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.
Comprehensive software engineering curriculum
·
Module 6
Dynamic Programming in Practice
1
Dynamic Programming: Memoization (Top-Down)
Implement a dynamic programming solution using memoization (top-down approach).
2
Tabulation for Dynamic Programming
Implement a dynamic programming solution using tabulation (bottom-up approach).
3
DP Complexity Analysis
Analyze the time and space complexity of a given DP solution.
4
0/1 Knapsack with Dynamic Programming
Solve the 0/1 Knapsack problem using dynamic programming.
5
Solving LCS with Dynamic Programming
Solve the Longest Common Subsequence problem using dynamic programming.
6
Dynamic Programming: Edit Distance
Solve the Edit Distance problem using dynamic programming.
Previous module
Algorithmic Design Paradigms
Next module
SOLID Design Principles