Sliding Window Maximum: coding question

Problem

You get an integer array nums and an integer k. A window of size k covers k consecutive items of nums.

The window starts at the left end of nums. At each step, the window moves one position to the right. It stops when it covers the last item.

Return an array with the largest value in the window at each position.

Input:: nums = [4,2,12,3,8,1,7], k = 3
Output:: [12,12,12,8,8]
Explanation:: The first window is [4, 2, 12], and its largest value is 12. The last window is [8, 1, 7], and its largest value is 8.

Input:: nums = [5,-3,9], k = 1
Output:: [5,-3,9]
Explanation:: Each window holds one item, so the answer is a copy of nums.

SysRound wrote this statement. A reference solution checks every example.

Continue with questions that share topics or the same question type.

Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit
Coding · Array · Heap (Priority Queue) · Monotonic Queue
Shortest Subarray with Sum at Least K
Coding · Array · Binary Search · Heap (Priority Queue)
Count Subarrays With Fixed Bounds
Coding · Array · Monotonic Queue · Queue
Maximum Coins From K Consecutive Bags
Coding · Array · Binary Search · Greedy

Sources · 2 references

These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.

Hello Interview · 5 records

Problem

You get an integer array nums and an integer k. A window of size k covers k consecutive items of nums.

The window starts at the left end of nums. At each step, the window moves one position to the right. It stops when it covers the last item.

Return an array with the largest value in the window at each position.

Input:: nums = [4,2,12,3,8,1,7], k = 3
Output:: [12,12,12,8,8]
Explanation:: The first window is [4, 2, 12], and its largest value is 12. The last window is [8, 1, 7], and its largest value is 8.

Input:: nums = [5,-3,9], k = 1
Output:: [5,-3,9]
Explanation:: Each window holds one item, so the answer is a copy of nums.

SysRound wrote this statement. A reference solution checks every example.