Dynamic Programming -

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

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

: This approach starts with the original complex problem and breaks it down recursively. It uses a data structure (like an array or hash map) to store ("memoize") the results of subproblems so they can be reused when encountered again. : The optimal solution to the larger problem