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
Mr. V#10503
Medium
COWBASIC#10531
Very hard
Subsequence Reversal#10555
Very hard
Cow Checklist#10563
Medium
Robotic Cow Herd#10567
Very hard
248#10576
Easy
262144#10577
Hard
Landscaping#10579
Very hard
Circular Barn (Platinum)#10591
Very hard
Angry Cows (Gold)#10598
Very hard
Radio Contact#10599
Medium
Help Yourself (Platinum)#10607
Very hard