Rishabh and Ojas are on a mission. Their is a bomb which they want to diffuse but the problem is they have to solve a task first which is very difficult for them.
As you are their friend, they ask you to solve the problem for them.
Given an integer array A containing N integers.
You need to find the total number of Scaler Subarrays in A.
A subarray is called Scaler Subarray if there are exactly B elements in the subarray which occurs atleast 2 times.
1 <= N <= 105
1 <= A[i] <= 103
1 <= B <= N
First argument is an integer array A.
Second argument is an integer B.
Return an integer denoting the total number of Scaler Subarrays in A.
NOTE: It is guaranteed that the output never exceeds the INTEGER 32 Bit range.
A = [1, 2, 3, 1, 2, 3] B = 2
A = [1, 1, 1, 2, 2] B = 1
There are only two Scaler Subrrays 1. A[0:4] i.e [1, 2, 3, 1, 2] as 1 and 2 only have occurences greater than or equal to 2 2. A[1:5] i.e [2, 3, 1, 2, 3] as 2 and 3 only have occurences greater than or equal to 2
NOTE: You only need to implement the given function. Do not read input, instead use the arguments to the function. Do not print the output, instead return values as specified. Still have a question? Checkout Sample Codes for more details.