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
Cutting#4595
Very easy
Grouping#4599
Very hard
Reduction#4610
Very easy
Towers#4630
Medium
One-two#4648
Very easy
Number of requests#4652
Very hard
Robot horse#4654
Very hard
Hippopotamus#4664
Medium
2-3 Trees#4668
Very easy
Fibonacci#4730
Very easy
iccanobiF#4732
Easy
Fibonacci number system#4758
Very easy
Generalized Fibonacci Numbers#4806
Very easy
ATM#4813
Easy
T-shirts#4814
Easy
Knapsack#4831
Medium