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
Happy Birthday#2852
Very easy
I love Ira#2853
Medium
Servers#2881
Very easy
Spell Check#2891
Very easy
Stones#2901
Very hard
Rain#2929
Easy
Binary Products#2947
Very easy
Persistent list#2957
Medium
Dial#2985
Easy
Paths#2988
Very hard
Cherry#2990
Very hard
Salutes#3005
Medium
Micro and Tree#3030
Medium
Laser#3032
Medium
Highway#3038
Hard
Clipboard#3040
Very easy
Bishops#3058
Very easy
Minimizing maximizer#3059
Very easy
Coin Collecting#3065
Very hard
Game, Set and Match#3068
Medium