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
ABA#9594
Very easy
Time is Mooney#9602
Medium
Farmer John Solves 3SUM#9603
Very easy
Springboards#9604
Medium
Nautilus#9620
Easy
Alpine valley#9621
Medium
Frog#9628
Medium
Optimal Matrix Multiplication#9647
Very easy
Macarons#9672
Very easy
Candy Chain#9673
Very hard
Ingredients#9674
Very easy
Crosswords#9688
Hard
Bipartite Blanket#9724
Very hard
The ABCD Murderer#9747
Very hard
Matrice#9756
Hard
K==S#9766
Very hard
Old Huseyn#9783
Very easy
Sum 6#9975
Very easy