Dynamic_Programming:-
1)Fibonacci Series
2)Longest Common Subsequence (LCS) (Bottom Up approach)
3)Matrix Chain Multiplication using iteration (Bottom Up approach)
4)Matrix Chain Multiplication using recursion (Top Down approach)
5)Multi Stage Graph (Shortest Path)
6)Subset Sum
7)0/1 Knapsack