Sliding Window Maximum Problem

Sliding Window Maximum Problem — ExecCode Hard DSA Practice

Solve the Sliding Window Maximum problem on ExecCode. Free online hard DSA practice in Arrays - Basics. Write and run code in Java, C++, Python — no signup required to run.

Problem description

You are given an array of integers nums, there is a sliding window of size k which is moving from the very left of the array to the very right. You can only see the k numbers in the window. Each time the sliding window moves right by one position. Return the max sliding window.

Examples

Input nums = [1, 3, -1, -3, 5, 3, 6, 7], k = 3; Output [3, 3, 5, 5, 6, 7]. Input nums = [1], k = 1; Output [1]. Input nums = [9, 11], k = 2; Output [11]

Constraints

1 ≤ nums.length ≤ 10⁵ -10⁴ ≤ nums[i] ≤ 10⁴ 1 ≤ k ≤ nums.length

Practice Sliding Window Maximum free on ExecCode. Browse DSA problems, topic map, and placement guides.