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
k-Tree#7313
Easy
Counting-Out#7332
Medium
Unknown digit#7343
Very easy
Boxes#7373
Medium
Barrel#7375
Easy
Discounts-2#7382
Medium
Mutation#7383
Easy
Line#7384
Very easy
Binary password#7438
Very easy
Contest preparation#7446
Very easy
Cut a string#7447
Very easy
Divide and conquer#7469
Medium
Shymbulak#7471
Hard
UFO#7472
Medium
K blocks#7473
Hard
Round words#7481
Very hard
Beautiful row#7484
Medium
Biochips#7486
Medium