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
Cent Savings#7853
Very easy
Digi Comp II#7854
Very easy
Indoorienteering#7859
Very easy
Better Productivity#7863
Very hard
Debugging#7865
Medium
Sliding wardrobe#7886
Medium
Golf Bot#7914
Easy
Diamonds#8174
Easy
Ramp Number#8177
Medium
Racing Gems#8187
Easy
Olympics#8190
Easy
Alphabet#8201
Very easy
Buggy Robot#8202
Hard
Barbells#8213
Easy
Steps - Number of Ways#8234
Very easy
Researchers#8253
Medium
Poetry#8285
Medium
Palindrome#8302
Very hard