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
Competition#2495
Medium
Viruses#2516
Easy
Fibonacci strings#2524
Very easy
Honeymoon Hike#2533
Very easy
Relocation#2534
Very easy
Serial Numbers#2558
Medium
Secret — MAX#2560
Very hard
Bridges#2571
Hard
Jams#2579
Easy
Dividing the Gold#2586
Very easy
Generic Cow Protests#2599
Very easy
Maximum sum#2613
Easy
Lemon Tale#2620
Hard
Warp Speed#2624
Very hard
Configurations#2626
Very hard
Shuffle#2630
Very hard
Cookies#2633
Very hard
Class Schedule#2645
Very easy
Queen to the corner 2#2657
Very easy
Terminator#2660
Medium