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
Ticket Draw#6038
Very hard
George Lucas and 1138#6047
Very easy
Power Grid#6051
Very hard
Sorting#6066
Very easy
Supernatural#6082
Very easy
Prime Caves#6105
Medium
Rotate and Rewrite#6107
Very hard
Puzzle#6133
Hard
Email#6134
Medium
3x+1#6144
Medium
RoboFest#6147
Easy
Coffee#6151
Very hard
ACM Fail#6152
Medium
Sixth Sense#6153
Very hard
Dota 2#6154
Hard
Wrong monks#6155
Very easy
Neighboring Towers#6157
Very easy
Trodden Cable#6161
Very hard