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
Book Shop#11500
Easy
Money Sums#11504
Easy
IOI Selection#11512
Very hard
Task Gauss#11517
Very hard
Help for Bit#11518
Very hard
Jumping#11519
Hard
Substring of a Palindrome#11524
Very hard
World of Darkraft - 2#11526
Very hard
Awkward situation#11532
Medium
Keech, Poch and the barn#11533
Very hard
Story#11540
Very hard
Competitive Programmers#11543
Very hard
Determinant of boolean matrix#11548
Very hard
x1+...+xk = n (2)#11551
Medium
Catch the Plane#11554
Very hard
Uncrossed Knight's Tour#11563
Very hard
The Cost of Speed Limits#11566
Very hard
Quests#11573
Very hard
Count palindromes#11592
Medium