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
Monkey at the Keyboard#5887
Very easy
Space Poker 3#5888
Very hard
How many are increasing?#5893
Very easy
Fibonacci Strings#5909
Medium
Happy Sum 3#5918
Easy
Mr. Chudakov's Buses#5920
Very easy
Knights#5937
Very hard
Isomorphisms – 2#5938
Very hard
Dark Nights#5946
Easy
Out of the line!#5973
Very easy
Olympic system#5974
Very hard
How to seat?#5980
Very hard
Keyboard#5983
Very hard
Democracy#5986
Hard
Change by Mass#6006
Very easy
Prime Time#6028
Hard