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
Gangs#6671
Easy
Eating Brains#6696
Very hard
Japhshan and Ramshut#6737
Very hard
Chemists#6738
Very hard
Set Division#6745
Very easy
Magical GCD#6768
Easy
Escape#6770
Medium
Equal Sum Sets#6778
Very easy
Longest Chain#6784
Very easy
Hidden Tree#6786
Very hard
Food Review#6832
Very easy
Optimal Keypad#6841
Medium
Up and Down#6852
Very hard
Increasing subsequences#6857
Very hard
RNA Molecules#6899
Very hard
Subset Sum#6903
Medium
Hopeless Coach#6908
Medium
Tic-tac-toe#6935
Very easy