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¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: array, dynamic programming
2866. Beautiful Towers II¶
-
LeetCode | LeetCode CH (Medium)
-
Tags: array, stack, monotonic stack
2617. Minimum Number of Visited Cells in a Grid¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: array, dynamic programming, stack, breadth first search, union find, heap priority queue, matrix, monotonic stack
2355. Maximum Number of Books You Can Take¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: array, dynamic programming, stack, monotonic stack