function minSubArrLen(arr, s) {
let l = 0;
let r = -1;
let res = arr.length + 1;
let sum = 0;
while(l < arr.length) {
if(r+1 < arr.length && sum < s) {
sum+=arr[++r];
}else {
sum-=arr[l--];
}
if(sum >= s) {
res = Math.min(res, r - l + 1);
}
}
if(res === arr.length + 1) {
return 0;
}
return res;
}