7 dynamic programming problems, solved step by step.

Problems where the answer for the whole is built from answers for smaller pieces: recursion with a memo first, then the table, then only the rows you still need. Each one is solved in 22 languages from brute force to optimal, with code you can run on the page.