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
HaHa`s Morning#3791
Medium
Processor#3819
Easy
Incredible! Impossible!#3864
Very hard
Compression#3880
Medium
Sum#3888
Hard
Aztec Pyramid#3889
Very easy
Cube#3926
Very easy
CosmoCraft#3971
Easy
Estimation#3975
Hard
Train delays#4017
Medium
Turtle#4018
Very easy
Turtle restoring#4019
Medium
Cult-orcs on the stairs#4020
Very easy