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
Removing Magical Tiles#6163
Very easy
Optimal alpha beta pruning#6164
Very hard
Dragon Pattern#6175
Very hard
Points#6176
Very easy
Candy Store#6210
Very easy
Unhappy Numbers#6218
Medium
Random Walking#6220
Medium
Full Tank#6221
Hard
Cliff Walk#6259
Easy
J#6269
Very hard
Autumn Park#6287
Medium
Cubicality#6306
Medium
Parade#6308
Medium
Lucky Ticket#6366
Medium
Positive Closure Sum#6377
Very hard
LIS#6378
Very hard
Chomp#6392
Hard
Just Enough Space#6415
Very easy
Bribe#6418
Medium