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
Number of Permutations#1926
Very easy
Enjoy Arithmetic Progressions#1928
Very hard
Fast Typing#1930
Very hard
Mushroom#1981
Very easy
How can I help?#1995
Very hard
Weighing 2#2005
Very hard
Mutation#2011
Medium
Sequence#2012
Very easy
Fibonacci sequence#2019
Medium
Fibonacci sequence#2031
Very easy
Inaccurate search#2082
Medium
Game Time#2104
Easy
Phidias#2126
Very easy
Football club#2161
Medium
Function Run Fun#2177
Very easy
Playing with graph#2220
Medium
Vaska Abroad#2240
Very easy
Super sum#2249
Easy
To Add or to Multiply#2281
Very easy