These are the one-dimensional dynamic programming problems every placement candidate should know. Say the state in one sentence first, then the base case and the transition, and test your program against every test.
0 /20 solved Easy 0/6 Medium 0/9 Hard 0/5
All Unsolved 20 Solved 0
Any level Easy Medium Hard
1. Ways to climb a staircase Easy 2. Three kinds of steps Easy 3. Cheapest climb Easy 4. Best loot without neighbours Easy 5. Best run of days Easy 6. Pay the exact amount Easy 7. Fewest coins Medium 8. Ways to pay as sets of coins Medium 9. Ordered payments Medium 10. Longest rising run of marks Medium 11. Ways to read a code Medium 12. Cut a label into words Medium 13. Fewest square tiles Medium 14. Lockers in a ring Medium 15. Best product of a run Medium 16. Count the ways to cut a label Hard 17. Nested boxes Hard 18. Fewest jumps Hard 19. Pick a value, lose its neighbours Hard 20. Count the longest rising runs Hard 