README.md

famous_dynamic_programs

solution in python 2.7

1. number of ways to reach between co-ordinates. (x,y) to (X,Y)
2. N coin problem
3. 0-1 Knapsack Problem
4. Longest Palindromic Subsequence