Skip to content

Overview Resume Score

Practice

LarpCode Reps LarpTalk

Interview

Templates Sessions

recent

Loading problem

Sliding Window Maximum · hard sliding window interview problem · Larpy

hard· sliding-window Mock interview

Sliding Window Maximum

Given an array `nums` and a window size `k`, return the maximum of each contiguous window of size k as the window slides from left to right.

Examples

in: nums = [1,3,-1,-3,5,3,6,7], k = 3

out: [3,3,5,5,6,7]

max of each window

Constraints

1 <= k <= len(nums) <= 10^5
-10^4 <= nums[i] <= 10^4

Hints

target: O(n) time⌘↩ run · ⇧⌘↩ submit

More sliding-window problems

Best Time to Buy and Sell Stockeasy
Minimum Window Substringhard
Longest Distinct Runmedium
Longest Repeating Character Replacementmedium
Permutation in Stringmedium
Minimum Size Subarray Summedium