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
Good days#4139
Easy
Number submission#4141
Very easy
Batch Scheduling#4144
Very easy
Chocolate bar#4148
Very easy
Balance it!#4150
Easy
Painting the Fence#4151
Medium
Rally#4174
Hard
Dominoes#4195
Medium
CD Recording#4198
Medium
Equilateral Dominoes#4224
Very hard
Hypercubes#4238
Very easy
Two lines#4246
Medium
17 chairs#4257
Very hard
Long Domino#4258
Easy
LCS-2#4260
Very easy
Appease Inti#4266
Very hard
Babs` Box Boutique#4267
Very easy