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
Marathon#3612
Hard
Olympic luggage#3613
Very easy
Disorder#3649
Very easy
How many prefixes?#3652
Very easy
Ambiguity by Fibonacci#3653
Very easy
Railway Tickets#3661
Very easy
K-angulation#3665
Very hard
Balancing the Matrix#3666
Very hard
How many are good?#3686
Medium
Snake#3689
Very hard
Placement of Rooks#3699
Medium
Sequence#3706
Easy
Tree#3710
Medium
Mutants-2#3739
Medium
Cube#3759
Medium
Railway Connection#3769
Very easy
Roller coaster fun#3778
Very easy
Treasure Diving#3783
Very hard