Dynamic Programming
Welcome to the Dynamic Programming section of our Algorithm programming tutorial. In this section, you'll learn about:
- Dynamic Programming Introduction
- Memoization Technique
- Tabulation Technique
- Overlapping Subproblems
- Optimal Substructure
- State Definition in Dynamic Programming
- Transition Functions
- 1D Dynamic Programming Problems
- 2D Dynamic Programming Problems
- Knapsack Problems
- Longest Common Subsequence
- Longest Increasing Subsequence
- Edit Distance
- Coin Change Problems
- Matrix Chain Multiplication
Have fun coding!
💡 Found a typo or mistake? Click "Edit this page" to suggest a correction. Your feedback is greatly appreciated!