Create Minimum Size Subarray Sum - Leetcode 209.py

Author: gahogg

Minimum Size Subarray Sum - Leetcode 209.py

@@ -0,0 +1,16 @@
+class Solution:
+    def minSubArrayLen(self, target: int, nums: List[int]) -> int:
+        min_length = float('inf')
+        summ = 0
+        l = 0
+      
+        for r in range(len(nums)):
+            summ += nums[r]
+            while summ >= target:
+                min_length = min(min_length, r-l+1)
+                summ -= nums[l]
+                l += 1
+        
+        return min_length if min_length < float('inf') else 0
+        # Time: O(n)
+        # Space: O(1)