Skip to main content

Queue Vis

FIFO • Priority Logic

Initializing Queue Canvas...

Playback Speed1x
Algorithm Details
Best Time
Ω(n)
Worst Time
O(n)
Aux Space
Θ(n)
Algorithm Logic
1Algorithm SlidingWindowMax(nums, k):
2 deque = Empty Deque
3 res = []
4 For i from 0 to length(nums) - 1:
5 If deque not empty and deque.front == i - k:
6 deque.pop_front()
7 While deque not empty and nums[deque.back] < nums[i]:
8 deque.pop_back()
9 deque.push_back(i)
10 If i >= k - 1:
11 res.push(nums[deque.front])
12 Return res