LECTURE 24 OF 25
Dynamic Programming
A repeatable way to solve a problem from related subproblems and reuse work already completed.
Builds on
Best read after 5. Recursion, 23. Backtracking — you can still read ahead, but some of this may lean on ideas covered there.