Dynamic Programming - Interval/Range
Scenario
Problem where the data can be divided into sub-intervals of a large intervals.
Clue
Look for problems where the optimal solution can be derived from optimal solutions of its sub-intervals.
Problems
| Problem | Link | Platform |
|---|---|---|
| Minimum Falling Path Sum | Link | |
| Burst Balloons | Link | |
| Partition Equal Subset Sum | Link | |
| Strange Printer | Link | |
| Maximum Vacation Days | Link |