Dynamic Programming from Zero

Content locked

The catalog is public. Reading this content requires approved access.

1. Start with a choice, not a table

2. Say exactly what a state means

3. Translate the cases

4. Fill a tiny table

5. Recover the actual choices

6. Prove it without saying “DP is optimal”

7. Analyze the work

8. Top-down and bottom-up solve the same states

9. When one index is insufficient

10. Your reusable design worksheet