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
Cut ribbon#11599
Medium
Coolest Ski Route#11627
Medium
Get 2024#11659
Medium
Fun Fibonacci#11663
Medium
Electrical switches#11691
Very hard
Reduce the array#11719
Medium
Rectangle Cutting#11722
Very easy
Infected Tree#11724
Medium
Pizzo Collectors#11735
Very hard
Storage Problems#11741
Medium
Card game#11745
Medium
Flag performance#11748
Very hard
Math jam#11770
Hard
University Exam#11781
Medium
Nuclear Reactor#11784
Medium
Horned Froglet#11801
Medium
Fabric#11803
Very hard