Code360 powered by Coding Ninjas X Naukri.com. Code360 powered by Coding
Ninjas X Naukri.com

Problem of the day

You are given an array 'ARR' of integers of length 'N' and a positive integer 'K'. You need to find the maximum elements for each and every contiguous subarray of size K of the array.

```
'ARR' = [3, 4, -1, 1, 5] and 'K' = 3
Output = [4, 4, 5]
Since the maximum element of the first subarray of length three ([3, 4, -1]) is 4, the maximum element of the second subarray of length three ([4, -1, 1]) is also 4 and the maximum element of the last subarray of length three ([-1, 1, 5]) is 5, so you need to return [4, 4, 5].
```

Detailed explanation

```
The first line of input contains a single integer 'T', representing the number of test cases or queries to be run. Then the 'T' test cases follow.
The first line of each test case contains two positive integers 'N' and 'K' which represent the length of the array and length of the subarray respectively.
The Second line of each test case contains 'N' space-separated integers representing the elements of the array.
```

```
For each test case, print 'X' space-separated integer denoting maximum elements for each and every contiguous subarray of size 'K' of the array. Where 'X' is the number of subarray of size 'K' in array 'arr'.
Output for each test case will be printed in a separate line.
```

```
You do not need to print anything; it has already been taken care of. Just implement the given function.
```

```
1 <= T <= 10
1 <= N <= 10^5
-10^5 <= arr[i] <= 10^5
1 <= K <= N
Time Limit: 1 sec
```

```
1
5 3
3 2 -6 1 0
```

```
3 2 1
```

```
The subarray of length 'K' maximum element of the subarray.
3 2 -6 3
2 -6 1 2
-6 1 0 1
Thus, you need to return "3 2 1".
```

```
1
9 3
1 2 3 1 4 5 2 3 6
```

```
3 3 4 5 5 5 6
```