[2,2,2,2,5,5,5,8]
3
4
[11,13,17,23,29,31,7,5,2,3]
3
5
class Solution {
public int numOfSubarrays(int[] arr, int k, int threshold) {
int left=0;
int right=0;
int n=arr.length;
int count=0;
int sum=0;
while(right<n){
sum+=arr[right];
if(left<=right && right-left+1 == k){
if(sum/k >= threshold) count++;
sum-=arr[left];
left++;
}
right++;
}
return count;
}
}