Optimization line
2-D Dynamic Programming problems
The same idea with two indexes: two strings, a grid, or a list and a budget. Each cell of a table is filled from cells already filled.
- 7 medium
- 4 hard
The 11 problems
In the order the app teaches them. Each page has the problem, five hints and the explained solution.
On the roadmap
2-D Dynamic Programming is a station on the optimization line. It builds on 1-D Dynamic Programming. Next comes Greedy.
The roadmap says why each line runs in its order.
Patterns
3 patterns solve these problems. Naming them gives the problems’ methods away, so the list is folded.
Show the 3
- Two-dimensional dynamic programming8 problems
- Knapsack dynamic programming2 problems
- Interval dynamic programming1 problem