Problem of the day
For the given array 'ARR' = [5, -3, 2, 3, -4] and 'K' = 2.
Output = -3 -3 0 -4
We have four windows of length 2 in 'ARR'
[5, -3] having -3 as first negative element.
[-3, 2] having -3 as first negative element.
[2, 3] having no negative element
[2, -4] having -4 as first negative element.
The first line of input contains an integer 'T' representing the number of test cases or queries to be processed. Then the test case follows.
The first line of each test case contains two single space-separated integers 'N' and 'K' representing the size of the array/list and the positive integer denoting the length of the window respectively.
The second line of each test case contains 'N' single space-separated integers representing the array/list elements.
For each test case, print (N - K + 1) single space-separated integers representing the first negative element in each of the windows of length 'K'.
Print output of each test case in a separate line.
You are not required to print the expected output; it has already been taken care of. Just implement the function.
1 <= T <= 10
1 <= N <= 5 * 10^4
1 <= K <= N
-10^9 <= ARR[i] <= 10^9
Time Limit: 1 sec
2
5 3
4 0 3 -12 1
3 1
45 12 -6
0 -12 -12
0 0 -6
For the first sample test case, we have three windows of length 3 in the first test case
[4, 0, 3] having no negative element.
[0, 3, -12] having -12 as first negative element.
[3, -12, 1] having -12 as the first negative element.
For the second sample test case, please refer problem statement for the explanation.
2
8 2
4 -7 4 6 7 -11 2 4
3 2
1 2 3
-7 -7 0 0 -11 -11 0
0 0