hardGoogle Meta Amazon

Sliding Window Maximum (monotonic deque).

Finding the max of every window of size k naively is O(n*k). The trick that drops it to O(n) is a monotonic deque of indices, and the reason it stays linear surprises most candidates.

Updated Aug 2026 · Grounded in real Applied AI Engineer interview loops and written to a senior-engineer editorial bar.

Finding the max of every window of size k naively is O(n*k). The trick that drops it to O(n) is a monotonic deque of indices, and the reason it stays linear surprises most candidates.

Unlock the other 750 answers · ₹2,000 / $25Your progress and mastery stay saved · 6 months · one payment · no auto-renew

UP NEXT ON YOUR JOURNEY

Next in this trackMeeting Rooms II: minimum rooms for overlapping intervals.Next in this trackKth Smallest Element in a BST (in-order traversal).Next in this trackSearch a sorted 2D matrix (staircase search).

DISCUSSION · 0

No comments yet — be the first to share your approach.