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
Skyscrapers#1535
Medium
Fast Postman#1552
Very easy
Platform Jumper#1553
Very easy
Forbidden Strings#1554
Very easy
Wild Card#1556
Very easy
Bracket Maze#1557
Medium
Rube Goldberg Device#1558
Very easy
Elective System#1559
Very easy
Decreasing Number#1560
Very easy
Send a Table#1563
Very easy
Probability Given#1578
Medium
The Dice Game#1581
Medium
Fill the Box#1595
Very easy
Dynamic Frog#1599
Very easy
Prize Collection#1619
Very easy
Brackets#1653
Easy
Game#1660
Easy
Gold Rush#1664
Hard