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
Game#8587
Hard
Table#8591
Medium
XOR sum#8647
Hard
A Simple Sum#8655
Medium
Another Game#8675
Very easy
XOR#8677
Medium
Game#8695
Easy
Sequence#8702
Easy
How to lose a contest#8711
Very easy
Robot Race#8714
Very hard
Six#8721
Very hard
Experiences#8724
Hard
MAXCOMP#8726
Very easy
Gift#8750
Very easy
Unfair Game#8797
Medium
Fear#9011
Medium
Dice Combinations#9036
Very easy