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
Game Level Detector#3322
Very hard
Just Sum It#3331
Easy
Fire Drill#3334
Very easy
Family Fortune#3342
Very easy
City Game#3348
Very hard
Alibaba#3351
Hard
Game#3361
Easy
Zombie Swallows#3367
Very hard
Dispatching#3384
Very easy
Bus Tour#3389
Easy
Room Service#3394
Very hard
Stacking Plates#3397
Very easy
City Merger#3434
Very easy
Captain Q`s Treasure#3435
Very hard
Binary Search#3451
Very hard
Party Schedule#3495
Very easy