LeetCode 862: Shortest Subarray with Sum at Least K
A clear explanation of finding the shortest non-empty subarray with sum at least k using prefix sums and a monotonic deque.
Tag
Monotonic-Queue
2 notes
2 notes
A clear explanation of finding the shortest non-empty subarray with sum at least k using prefix sums and a monotonic deque.
A clear explanation of finding the maximum value in every sliding window using a monotonic deque.