import math

class Solution:
  def findMinSubArray(self, s, arr):
    sum = 0
    j = 0
    min_sum = float('inf')
    for i in range(len(arr)):
      
      sum += arr[i]
      
      while sum >= s:
        diff = i - j + 1
        min_sum = min(min_sum, diff)
        sum -= arr[j]
        j += 1

    # inf happens if we have nothing >= s we want to return 0 not inf
    return min_sum if min_sum != float('inf') else 0