Home Roadmap Courses Problems Dashboard Pricing

Home Roadmap Courses Problems Dashboard Pricing

Loading editor…

Problem 42

Sliding Window Maximum

HardSliding WindowStack

From nums, return an array of the maximum in every contiguous window of length k.

Examples

Example 1

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

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

Constraints

1 ≤ nums.length ≤ 10⁵1 ≤ k ≤ nums.length

Target ComplexityNot required

O(n) Time · O(n) Space

Companies (6)

AmazonGoogleMetaMicrosoftAppleUber

Node 22.08.0

Loading editor…

Test casesRun to compare output

Inputnums = [1,3,-1,-3,5,3,6,7], k = 3

Expected[3,3,5,5,6,7]

Output—