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
Candy#1671
Medium
Olympiad#1672
Easy
Fractal#1676
Easy
Pinocchio#1706
Easy
Pretty Tables#1719
Very easy
A + B Problem#1729
Medium
Maximum Subpalindrome#1740
Very easy
Cute patterns 1#1761
Very easy
Numbers#1762
Very easy
Network#1763
Very easy
Sequence#1764
Easy
Three sequences#1765
Very easy
Diamonds joker#1767
Very easy
Schedule#1768
Medium
Common Subsequence#1774
Very easy
Money Distribution#1786
Very easy
Quick Search#1816
Very easy
Image Compression#1817
Very easy