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
Cow Poetry#10335
Hard
Redistricting#10338
Very easy
Train Tracking 2#10340
Very hard
Cow Land#10347
Very easy
Painting the Barn (Gold)#10349
Very hard
Cow Dating#10350
Easy
Moorio Kart#10351
Very hard
Mowing Mischief#10352
Very hard
Cool substring#10360
Medium
Spaceship#10374
Very hard
Cowmistry#10375
Easy
Teamwork#10401
Medium
Sort It Out#10403
Very hard
Stamp Painting#10425
Very hard
Cave Paintings#10439
Very hard
Non-Decreasing Subsequences#10440
Very hard
Kozak Vus and NSD#10447
Medium