Dynamic Programming

1. Break down the problem into a collection of simpler subproblems

2. Solve each of those subproblems just once, and storing their solutions.

3. The next time the same subproblem occurs, instead of recomputing its solution, one simply looks up the previously computed solution

Thereby save computation time at the expense of storage space.

Reference

https://en.wikipedia.org/wiki/Divide_and_conquer_algorithm