dsa2 min read
Sliding Window Maximum [Hard] — Monotonic Deque
Find the maximum in every sliding window of size k in O(n) using a monotonic decreasing deque.
Read →
Deque
7 articles
dsa1 min read
Shortest Subarray with Sum ≥ K [Hard] — Deque on Prefix Sums
Find the shortest subarray with sum >= K using a monotonic deque on prefix sums, handling negative numbers correctly.
Read →
dsa1 min read
Shortest Subarray with Sum at Least K — Deque + Prefix Sum
Find the shortest subarray with sum >= k using a monotonic deque on prefix sums for O(n) time.
Read →
dsa1 min read
Sliding Window Maximum [Hard] — Monotonic Decreasing Deque
Find the maximum in every sliding window of size k in O(n) using a monotonic decreasing deque of indices.
Read →
dsa1 min read
Shortest Subarray with Sum ≥ K [Hard] — Monotonic Deque on Prefix
Find the shortest subarray with sum >= k, handling negative numbers correctly using a monotonic deque on prefix sums.
Read →
dsa2 min read
Google — Sliding Window Maximum (Monotonic Deque)
Find the maximum in every sliding window of size k using a monotonic decreasing deque. O(n) solution that Google uses to test understanding of amortised data structures.
Read →
dsa3 min read
Design Snake Game — Deque-Based State Machine
Simulate a snake game on a grid where the snake eats food to grow and dies if it hits walls or itself. Uses a deque for O(1) head/tail and a set for O(1) body collision checks.
Read →