Given an array and a positive integer k, find the first negative number in every window of size k. If a window does not contain a negative number, print 0 for that window.
{
"A": [
-8,
2,
3,
-6,
10
],
"K": 2
}[
-8,
0,
-6,
-6
]{
"A": [
12,
-1,
-7,
8,
-15,
30,
16,
28
],
"K": 3
}[
-1,
-1,
-7,
-15,
-15,
0
]{
"A": [
1,
2,
3
],
"K": 2
}[
0,
0
]Sign in to Run Code and Submit