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
Innovative hanger#9046
Very easy
Rectangle Painting#9050
Medium
XOR path#9088
Medium
Investments Lady#9091
Very hard
G. Team#9092
Easy
Subsequences of Subsequences#9095
Very easy
Boardroom Meeting#9101
Very easy
Masterpiece#9106
Very easy
Excalibur#9411
Easy
Hard Cuts#9440
Medium
Big changes#9507
Very easy
Double Palindrome#9521
Medium
Flags#9558
Easy
Game Relics#9586
Easy
Key Storage#9590
Very easy