hard20 pts · first answer countsstacks-and-queues

Sliding window maximum

For [1, 3, -1, -3, 5, 3, 6, 7] and window size 3, what are the maximums of each window, and how can you get them in O(n)?

A.[3, 3, 5, 5, 6, 7], with a deque of indices in decreasing value orderB.[3, 3, 5, 5, 6, 7], by sorting each windowC.[3, 3, 3, 5, 6, 7], with a deque of indices in decreasing value orderD.[1, 3, 5, 5, 6, 7], with a min-heap of the window

Discussion 0

Join free to post in the discussion.

Sliding window maximum

Discussion 0

Related questions