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
Stones#5306
Very easy
Eagles and Woodpeckers#5310
Very hard
B-trees#5312
Very hard
Party#5329
Very easy
Thylacine#5331
Very easy
Breakfast Sandwiches#5385
Very easy
Sliding Block Puzzle#5416
Very hard
Diplomas#5435
Very easy
Fibonacci strings#5437
Medium
Mushrooms#5438
Medium
Cinema tickets#5463
Medium
Starry lines#5466
Very easy