
Asked in Practo
Sliding Window Maximum
Given an array of integers with size N
and a number K
, your task is to determine the maximum value of each subarray of length K
from the array.
Input:
The first line contains two integers, N
and K
separated by a space.
The second line contains N
integers separated by spaces, representing the elements of the array.
Output:
Output a single line containing N - K + 1
integers separated by spaces, each representing the maximum value of each K
-length subarray as they appear from left to right, starting at index 0.
Example:
Input:
9 3
1 3 1 2 0 5 3 5 6
Output:
3 3 2 5 5 5 6
Constraints:
0 <= N <= 5 * (10 ^ 5)
1 <= K <= N
- Time Limit: 1 sec
Note:
The function should only return the result; printing is managed elsewhere.
Be the first one to answer
Add answer anonymously...
Stay ahead in your career. Get AmbitionBox app


Trusted by over 1.5 Crore job seekers to find their right fit company
80 L+
Reviews
10L+
Interviews
4 Cr+
Salaries
1.5 Cr+
Users
Contribute to help millions
AmbitionBox Awards
Get AmbitionBox app

