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
Deque
5 notes
LeetCode 239: Sliding Window Maximum
A clear explanation of finding the maximum value in every sliding window using a monotonic deque.
LeetCode 353: Design Snake Game
A clear explanation of implementing Snake Game with a deque for body order and a set for constant-time collision checks.
LeetCode 272: Closest Binary Search Tree Value II
A clear explanation of the Closest Binary Search Tree Value II problem using inorder traversal and a fixed-size sliding window.
1.4 Queues and Deques
Array and linked queues, deques, monotonic queues, priority buckets, delay queues, and concurrent queue designs.