Subarray_Product_Less_Than_K.java

import java.util.Scanner;

public class Subarray_Product_Less_Than_K {
    public static void main(String[] args) {
        Scanner s=new Scanner(System.in);
        int n=s.nextInt();
        int k=s.nextInt();
        int arr[]=new int[n];
        for (int i = 0; i <arr.length; i++) {
            arr[i]=s.nextInt();
        }
//        int k=10;
        System.out.println(NoofSubArray(arr,k));
    }
    public static  int NoofSubArray(int[] arr,int k){
        int ans=0,si=0,ei=0,p=1;

        while(ei< arr.length)
        {
            //window grow
            p*=arr[ei];


            //window shrink
            while(p>=k && si<=ei){
                p/=arr[si];
                si++;
            }

            //ans calculate
            ans+=ei-si+1;
            ei++;
        }
        return ans;
    }
}