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
Regular expressions (Easy)#3181
Very easy
Boards (Hard)#3185
Very easy
Miles and kilometers#3188
Very easy
The Triangle#3189
Medium
Array games#3204
Very hard
Drafts and rabbits#3214
Very easy
Euro Efficiency#3225
Medium
Markov Trains#3226
Very hard
Pearls#3230
Medium
Bicolored Horses#3248
Very hard
Ship Routes#3249
Very easy
Testing the CATCHER#3251
Very easy
Save Walle#3257
Very easy
Multi Ending Story#3288
Very easy
Network Reliability#3289
Very easy
Testing Circuits#3292
Very hard
World Trip#3293
Very hard