Breaking a problem into smaller overlapping subproblems.

Solving problems in a sequential manner.

Dynamic programming can be used for problems where the solution has an optimal substructure.

Memoization, which involves storing the results of expensive function calls and reusing them.