Dynamic Programming -

: The optimal solution to the larger problem can be constructed from the optimal solutions of its subproblems. Common Approaches

: This approach starts by solving the smallest possible subproblems first and iteratively builds up to the solution of the original problem, usually filling out a table (matrix or array) in the process. Dynamic Programming

To apply dynamic programming effectively, a problem must typically exhibit two primary properties: : The optimal solution to the larger problem

: The same smaller problems are solved multiple times during a naive recursive approach. Dynamic Programming