Method sb

SubarraySumGreaterThanX.java:4–31

(int a[], int n, int x)

class Solution {

    public static int sb(int a[], int n, int x) {
        // Your code goes here 
        
        int start=0,end=1;
        int result=Integer.MAX_VALUE;
        int sum=a[start];
        if(sum>x) return 1;
        if(end<n) sum+=a[end];
        
        while(start<n && end<n)
        {
            if(sum>x)
            {
                result = Math.min(result,end-start+1);
                sum-=a[start];
                start++;
            }
            else
            {
                end++;
                if(end<n)
                {
                    sum+=a[end];
                }
            }
        }
        return result;
    }
}

//Leetcode solution