Problem of the day
Let 'N' = 5, 'K' = 4, 'A' = [2, 2, 2, 1, 1].
There exist only two subarrays, 'A[0…4]' and 'A[1…4]' having 'Pulse' greater than or equal to 'K'.
'Pulse' of 'A[0…4]' is 6 and the length is 5.
'Pulse' of 'A[1…4]' is 4 and the length is 4.
Since we have to minimize the length, therefore 4 will be our answer.
The first line contains an integer 'T', which denotes the number of test cases.
For every test case:-
The first line contains two space-separated integers 'N' and 'K', denoting the number of elements in the array 'A' and the minimum required 'Pulse' of the subarray respectively.
The second line contains 'N' space-separated integers, denoting the elements of the array 'A'.
Return the minimum possible length of a subarray having 'Pulse' greater than or equal to 'K'.
If there does not exist any subarray having 'Pulse' greater than or equal to 'K', then return -1.
You don’t need to print anything. Just implement the given function.
1 <= 'T' <= 10
0 <= 'N' <= 10^5
0 <= 'K' <= 10^9
1 <= 'A[i]' <= 10^5
The sum of 'N' over all test cases does not exceed 10^5.
Time Limit: 1 sec
2
6 6
2 1 2 3 4 3
1 2
1
5
-1
First test case:-
There exist only three subarrays, 'A[0…4]', 'A[1…5]' and 'A[ 0…5]' having 'Pulse' greater than or equal to 'K'.
'Pulse' of 'A[0…4]' is 6 and the length is 5.
'Pulse' of 'A[1…5]' is 6 and the length is 5.
'Pulse' of 'A[0…5]' is 9 and the length is 6.
Since we have to minimize the length, therefore 5 will be our answer.
Second test case:-
There does not exist any subarray having 'Pulse' greater than or equal to 'K'.
2
2 1
1 2
4 2
1 1 2 1
2
3