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
Triangular Tiling#3082
Very hard
Wikipidia#3083
Very hard
Yummy Triangular Pizza#3086
Very easy
Winmine.exe#3088
Very hard
Revenge of Fibonacci#3093
Very easy
Quelling Blade#3094
Very hard
Queen Game#3099
Very easy
Bad Wiring#3126
Very easy
Clickomania#3136
Hard
Balance#3137
Very hard
North East King#3174
Very easy