Dynamic programming

Dynamic programming solves overlapping subproblems and stores their answers for reuse.

Remember: Solve a state once; reuse its answer.

Example: Store the best value for each item count and knapsack capacity.

The interactive workspace loads here when JavaScript is available. You can still browse the learning notes and links above without it.