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
Stepan's heritage#4284
Medium
Stack Maze#4295
Very hard
Hashigo Sama#4299
Very hard
Sets#4306
Easy
AVL#4315
Easy
Ring#4323
Very hard
Bridges: The Final Battle#4326
Very hard
Feathers on the Shaman's Head#4335
Very hard
Work for Robots#4346
Very easy
Salary for Robots#4347
Very easy
T-shirter#4358
Easy
Die Young#4382
Easy