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
Magic Sticks#2287
Very easy
Pyramids#2290
Easy
Steps#2306
Very easy
Nonsense#2332
Easy
Little Bishops#2352
Very easy
Tug of War#2353
Medium
Dice#2373
Easy
Keyboard Game#2412
Very hard
Sum of squares#2414
Medium
How many ways?#2422
Very easy
Fibonacci System#2425
Very easy
Game Progress#2431
Very hard
Balls#2442
Hard
Adjacent Bit Counts#2445
Medium
Free Goodies#2450
Very easy
High Score#2451
Very easy
Two piles#2485
Easy