Dynamic Programming¶

1. Divide the problem into stages
2. Find the solution stage-by-stage
3. Combine all stages to find overall solution