DP Monotonic Stack¶
Table of Contents¶
- 1335. Minimum Difficulty of a Job Schedule (Hard)
- 2866. Beautiful Towers II (Medium)
- 2617. Minimum Number of Visited Cells in a Grid (Hard)
- 2355. Maximum Number of Books You Can Take (Hard) 👑
1335. Minimum Difficulty of a Job Schedule¶
2866. Beautiful Towers II¶
2617. Minimum Number of Visited Cells in a Grid¶
-
Tags: Array, Dynamic Programming, Stack, Breadth First Search, Union Find, Heap Priority Queue, Matrix, Monotonic Stack