function minSubArrayLen(arr, k) {

    let min = arr.length + 1, sum = 0, i = 0, j = 0;
    while (j < arr.length) {
        //Advance j as long as sum is less than target
        while (sum <= k && j < arr.length) {
            sum += arr[j++];
        }

        while (sum > k && i < arr.length) {
            sum -= arr[i++];
        }
        console.log("value of j " + j);
        console.log("value of i " + i);
        const temp = j - i;
        if ( temp < min) min = temp;

    }

    return min === arr.length+1 ? 0 : min;

}