Dynamic programming
Defined in 2 lectures. Each definition is in that lecture's terms.
Definitions are written by AI from each lecture’s transcript. The time opens the lecture where the lecturer explains it.
- A general, powerful algorithm design technique that is especially good and intended for optimization problems, acting roughly as a careful brute force by breaking a problem into subproblems and reusing their solutions.
- Solving a hard problem by reusing solutions to smaller subproblems.