Add 'Minimum Size Subarray Sum'

Author: nickolashkraus

README.md

@@ -54,6 +54,8 @@ A collection of LeetCode solutions
 
 [Middle of the Linked List](./src/middle_of_the_linked_list.py)
 
+[Minimum Size Subarray Sum](./src/minimum_size_subarray_sum.py)
+
 [Product of Array Except Self](./src/product_of_array_except_self.py)
 
 [Remove Nth Node From End of List](./src/remove_nth_node_from_end_of_list.py)

src/minimum_size_subarray_sum.py

@@ -0,0 +1,32 @@
+"""
+209. Minimum Size Subarray Sum
+
+https://leetcode.com/problems/minimum-size-subarray-sum
+
+NOTES
+  * Use a sliding window.
+
+A subarray is a contiguous, non-empty sequence of elements within an array.
+Here, we just apply the canonical subarray/substring solution using a sliding
+window.
+"""
+
+import sys
+
+
+class Solution:
+    def minSubArrayLen(self, target: int, nums: list[int]) -> int:
+        left, right, current_sum, current_size, minimum_size = 0, 0, 0, 0, sys.maxsize
+
+        while right < len(nums):
+            current_sum += nums[right]
+            current_size += 1
+            while left <= right and current_sum >= target:
+                if current_size < minimum_size:
+                    minimum_size = current_size
+                current_sum -= nums[left]
+                current_size -= 1
+                left += 1
+            right += 1
+
+        return minimum_size if minimum_size < sys.maxsize else 0

tests/test_minimum_size_subarray_sum.py

@@ -0,0 +1,23 @@
+"""
+209. Minimum Size Subarray Sum
+
+https://leetcode.com/problems/minimum-size-subarray-sum
+"""
+
+from unittest import TestCase
+
+from src.minimum_size_subarray_sum import Solution
+
+
+class TestSolution(TestCase):
+    def test_1(self):
+        exp = 2
+        assert Solution().minSubArrayLen(7, [2, 3, 1, 2, 4, 3]) == exp
+
+    def test_2(self):
+        exp = 1
+        assert Solution().minSubArrayLen(4, [1, 4, 4]) == exp
+
+    def test_3(self):
+        exp = 0
+        assert Solution().minSubArrayLen(11, [1, 1, 1, 1, 1, 1, 1, 1]) == exp