LECTURE 24 OF 25
Dynamic Programming
A repeatable way to turn a slow recursive search into a fast one by identifying and reusing overlapping subproblems.
Builds on
Best read after 5. Recursion, 22. Greedy Algorithms, 23. Backtracking — you can still read ahead, but some of this may lean on ideas covered there.