Dynamic programming
Problems on dynamic programming, including counting paths in a grid, the longest increasing and longest common subsequences, edit distance, knapsack, coin change, dynamic programming on intervals, trees, digits and subsets, and games solved by computing winning states.
The introduction in the Dynamic programming section works through the method step by step. Narrower problem sets are under Knapsack, Bitmasks and Dynamic programming optimization.
Problems
Domino#10004
Easy
Units#10005
Very easy
Number Partitioning#10026
Very easy
Timeline#10123
Medium
Help Yourself#10124
Very easy
Running#10152
Easy
Cell Phone Network#10156
Medium
Function f(n)#10165
Very easy
Trio#10250
Very easy
Reduce to one#10272
Very easy
Magic set#10273
Very easy
Recursive function 1#10296
Very easy
Exercise (Gold)#10312
Very hard
Exercise (Platinum)#10314
Very hard
Snakes#10322
Hard
Compound Escape#10326
Very hard
Turtle - right top#10328
Very easy