Monotonic Queue Optimized DP¶
Table of Contents¶
- 2944. Minimum Number of Coins for Fruits (Medium)
- 1696. Jump Game VI (Medium)
- 1425. Constrained Subsequence Sum (Hard)
- 375. Guess Number Higher or Lower II (Medium)
- 1687. Delivering Boxes from Storage to Ports (Hard)
- 3117. Minimum Sum of Values by Dividing Array (Hard)
- 2945. Find Maximum Non-decreasing Array Length (Hard)
- 2969. Minimum Number of Coins for Fruits II (Hard) 👑
2944. Minimum Number of Coins for Fruits¶
-
LeetCode | LeetCode CH (Medium)
-
Tags: array, dynamic programming, queue, heap priority queue, monotonic queue
1696. Jump Game VI¶
-
LeetCode | LeetCode CH (Medium)
-
Tags: array, dynamic programming, queue, heap priority queue, monotonic queue
1425. Constrained Subsequence Sum¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: array, dynamic programming, queue, sliding window, heap priority queue, monotonic queue
375. Guess Number Higher or Lower II¶
-
LeetCode | LeetCode CH (Medium)
-
Tags: math, dynamic programming, game theory
1687. Delivering Boxes from Storage to Ports¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: array, dynamic programming, segment tree, queue, heap priority queue, prefix sum, monotonic queue
3117. Minimum Sum of Values by Dividing Array¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: array, binary search, dynamic programming, bit manipulation, segment tree, queue
2945. Find Maximum Non-decreasing Array Length¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: array, binary search, dynamic programming, stack, queue, monotonic stack, monotonic queue
2969. Minimum Number of Coins for Fruits II¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: array, dynamic programming, queue, heap priority queue, monotonic queue