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
Expression#7496
Easy
Kebab House#7502
Very easy
Locked Treasure#7534
Very easy
Binary vs Decimal#7562
Medium
Fygon#7617
Very hard
Subnumber#7663
Medium
Robbery#7664
Medium
Cubes#7676
Medium
A Journey to Greece#7706
Very easy
Souvenirs#7715
Very easy
Parades#7717
Very easy
The Leprechaun Hunt#7732
Very hard
Horses#7769
Very easy
Frightful Formula#7777
Very easy
Solitaire#7805
Easy
Billiard Balls#7806
Very hard
Subway rides#7818
Medium
Without repetitions#7824
Medium