Understand Dynamic Programming from basics

Introduction Dynamic programming is a technique to optimize a recursive problem's time complexity from exponential to polynomial time. This technique stores the results of the sub-problems generated during the time of recursion and uses these results...