DYNAMIC PROGRAMMING

1.   Longest Common Subsequence
2.   Longest Common Substring
3.   MAX APPLES THAT CAN BE COLLECTED IN 2D MATRIX
4.   VENDING MACHINE PROBLEM
5.   TRAVERSE THE ARRAY IN SHORTEST NUMBER OF HOPS
6.   Nth FIBONACCI NUMBER
7.   Longest Consecutive sequence of Numbers