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
Weighing balance#7110
Very easy
Races#7174
Easy
Banking#7196
Very easy
Game "Row of Chips"#7201
Medium
Pebbles#7202
Medium
Private interests#7205
Very easy
Numbers#7211
Medium
Checkers on the cube#7213
Very easy
Binary Tree#7223
Easy
Field of Wonders#7235
Very easy
Stepan's Exercises#7238
Medium
Simple Recurrence#7251
Very easy
A full set#7263
Easy
A granite of science#7268
Very hard
System of equations#7289
Very easy
Linguist#7291
Easy
Jump#7310
Medium