Dynamic programming is used where we have problems, which can be divided into similar sub-problems, so that their results can be re-used. Mostly, these algorithms are used for optimization. Before solving the in-hand sub-problem ,   dynamic  algorithm will try to examine the results of the previously solved sub-problems.