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
Periodic points#1820
Very easy
Enchanted Object Search#1824
Very easy
Assembly line#1826
Very easy
AVL-trees#1846
Very easy
Polynomial#1847
Easy
Tent#1855
Very easy
Rhyme scheme#1858
Medium
Miners#1859
Easy
Present for Piglet#1860
Very easy
Dice#1861
Easy
Strong tiling#1863
Very easy
Cute patterns 2#1866
Medium
Function#1868
Very easy
Paths on the board#1869
Very easy
Holidays#1874
Hard
Drawing#1909
Medium
Diamond#1917
Easy
Traffic Jam#1925
Very hard