Dynamic Programming: States & Transitions

Choosing states and transitions, memoization vs bottom-up, and counting the state space.

0 / 5 solved

Question Tags Difficulty Success

1. Remember the Past

Algorithms

Easy 45%

2. The Key Forgot Capacity

dynamic-programmingmemoization +2

Medium —

3. Reading The Column Early

dynamic-programmingevaluation-order +2

Medium —

4. What The Threshold Remembers

dynamic-programmingstate-definition +2

Medium —

5. Depth Against Density

dynamic-programmingmemoization +2

Hard —

Learning Resources

MIT 6.006 Lecture 15, Dynamic Programming, Part 1

Jeff Erickson, Dynamic Programming chapter

USACO Guide, Introduction to DP

Up next

5 of 5 questions here are still unsolved.

Next module Classic DP Families