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
Beautiful Permutation#5676
Very hard
Secret Lab#5678
Very hard
Your Ways#5701
Very hard
Nowhere Money#5705
Very hard
Vasya and Fibonacci#5710
Very easy
Tower#5735
Very hard
Counting heaps#5738
Very hard
Ball Stacking#5741
Very easy
Garden Fence#5746
Very hard
Binary Polynomials#5758
Medium
Deposit#5760
Easy
Wheel#5764
Hard
Sale#5769
Easy
Petya is resting#5772
Very hard
Zigzag#5795
Very hard
Minimal Backgammon#5828
Medium
Connect#5838
Very hard
Do use segment tree#5839
Very hard
Move on Dice#5840
Very easy