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 8
Classic Dynamic Programming Applications
1
Dynamic Programming for 0/1 Knapsack
Solve the 0/1 knapsack problem using a DP formulation.
2
Longest Common Subsequence: Problem and Reconstruction
Solve the longest common subsequence (LCS) problem and reconstruct the subsequence.
3
LIS with DP
Solve the longest increasing subsequence (LIS) problem using DP.
4
Solving Edit Distance with Dynamic Programming
Solve the edit distance (Levenshtein) problem by tracing the DP table.
5
Solving the Coin Change Problem
Solve the coin change problem for a finite number of coins.
Previous module
Introduction to Dynamic Programming
Next module
Advanced Algorithmic Patterns