First Negative Integer in Every Window of Size K

Given an array of integers 'ARR' and an integer 'K', determine the first negative integer in every contiguous subarray (or window) of size 'K'. If a window does not contain a negative integer, the output for that window should be 0.

Input:

T N arr[0] arr[1] ... arr[N-1] K

Output:

Output for each test case should be the first negative integer in each window of size K, separated by a space.

Example:

Input:

1 9 -10 20 -30 -40 50 60 -70 80 90 3

Output:

-10 -30 -30 -40 -70 -70 -70

Constraints:

1

Question

First Negative Integer in Every Window of Size K

Given an array of integers 'ARR' and an integer 'K', determine the first negative integer in every contiguous subarray (or window) of size 'K'. If a window does not contain a negative integer, the output for that window should be 0.

Input:

T 
 N 
 arr[0] arr[1] ... arr[N-1] 
 K

Output:

Output for each test case should be the first negative integer in each window of size K, separated by a space.

Example:

Input:

1
9
-10 20 -30 -40 50 60 -70 80 90
3

Output:

-10 -30 -30 -40 -70 -70 -70

Constraints:

1 <= T <= 10²
1 <= N <= 10³
-10⁴ <= data <= 10⁴
1 <= K <= N

Note: You do not need to print anything; focus on implementing the function as instructed.

Accepted Answer

Find the first negative integer in every window of size K in an array.

Iterate through the array using a sliding window approach of size K
For each window, find the first negative integer and add it to the result array
If no negative integer is found in a window, add 0 to the result array

First Negative Integer in Every Window of Size K

Input:

Output:

Example:

Input:

Output:

Constraints:

DE Shaw Software Developer Intern interview questions & answers

Popular interview questions of Software Developer Intern