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
Shallow sequences#4440
Very easy
Removing Brackets 2#4443
Very easy
Cost of the route#4444
Medium
Flights#4456
Easy
Domino#4469
Very easy
Coins#4470
Very hard
Vasylko and Sequences#4511
Very easy
Delivery#4517
Hard
Text on the fence#4528
Medium
Counting Triangles#4556
Very easy
High Fence Coloring#4565
Very easy
Junior Fence Painting#4566
Very easy
Twin Cities Junior#4568
Medium
Relaxation by the High River#4569
Very easy
Relaxation by the River Junior#4570
Very hard
Card Duel#4577
Very easy
Junior Card Duel#4578
Medium