Divide and Conquer

1. Breaking down a problem into two or more sub-problems of the same or related type

2. Until these become simple enough to be solved directly

3. The solutions to the sub-problems are then combined to give a solution to the original problem

Reference

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