Classic Problems (DP)

← Back to Dynamic Programming

Well-known optimization and counting problems that are canonical examples of dynamic programming. Mastering these problems builds the intuition needed to apply DP to novel situations.

Key Properties

• Knapsack
• LCS
• LIS
• Edit Distance (DP)
• Matrix Chain Multiplication
• Coin Change

---

algorithms dynamic-programming classic-problems