Given an array and a positive integer k, find the first negative integer for each and every window(contiguous subarray) of size k.
The first line of input contains an integer T denoting the number of test cases. Then T test cases follow. Each test case contains an integer n denoting the size of the array. The next line contains n space separated integers forming the array. The last line contains the window size k.
Print the space separated negative integer starting from the first till the end for every window size k. If a window does not contain a negative integer , then print 0 for that window.
-8 2 3 -6 10
12 -1 -7 8 -15 30 16 28
-8 0 -6 -6
-1 -1 -7 -15 -15 0
If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.