Skip to content

Dynamic Programming

Andrew Shepherd edited this page Oct 31, 2024 · 2 revisions

Dynamic Programming

If you can distil a problem down into a grid of numbers, where each number can be calculated from the number above and the number to the left, then that's a dynamic programming problem.

Once you've managed to reduce the problem to this, it's usually quite easy from there. But coming up with the grid can be really tricky, and usually involves some AHA! moment.

Problems

Clone this wiki locally