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
Homework#5479
Very hard
Settlement#5485
Hard
Even more fun#5488
Very hard
Moo#5491
Easy
Just Add It#5493
Very easy
Ministry of Truth#5504
Medium
The Grasshopper and the Ant#5528
Very easy
Strings#5535
Easy
Again palindromes#5538
Very easy
Corridor#5544
Easy
Explosion#5546
Very easy
Fibonacci System#5559
Medium
GOV-internship 3#5617
Medium
Harvard#5654
Very hard
Security Vault System#5657
Very hard
Pirate Chest#5658
Very hard
Up a Tree#5660
Very hard
Fibonacci Subsequence#5663
Very easy
Hexagon and Rhombic Dominoes#5664
Very easy
Parallel Processes#5675
Very hard