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
Presentation#5842
Medium
Sun and Moon#5844
Medium
Computer Game (Platforms)#5846
Very easy
Chess#5853
Very hard
Maximum Sum basic#5854
Very easy
MaxSum (Happy Sum - 2)#5861
Very easy
Solitaire#5863
Easy
Grundy's game#5874
Very easy