# top dynamic programming questions

- 0 - 1 Knapsack Problem
- Longest Common Substring
- Longest Common Subsequence
- Edit Distance
- Count all possible paths from top left to bottom right
- subset sum problem-if there is a subset of the given set with sum equal to given sum.
- Subset equal sum partition problem
- Coin Change-no of ways to get a total
- minimum coin change problem
- Minimum number of jumps
- Maximum sum increasing subsequence
- Longest Increasing Subsequence
- Min Cost Path-dynamic programming
- Path in Matrix-dynamic programming
- Longest Palindrome in a String(subset)
- Longest Palindromic Subsequence
- Maximize The Cut Segments-dynamic programming
- word break problem
- Minimum number of Coins
- max-length chain
- max-rectangle
- Largest square formed in a matrix
- Optimal Strategy For A Game
- Egg Dropping Puzzle