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
Honeycomb#5092
Medium
Hodja Nasreddin#5101
Very easy
Koza Nostra#5103
Easy
Lego#5110
Very easy
Folding#5179
Very easy
Antagonistic Game#5184
Very easy
Fibonacci Numbers#5197
Medium
Fibonacci Numbers#5203
Medium
Parentheses#5205
Very easy
Logical Tree#5206
Very easy
Palindrome#5207
Easy
Sum of cubes#5208
Medium
Archiver#5238
Hard
Hiking#5277
Very easy
Path#5279
Very easy