added a problem with solution on sliding window. (TheAlgorithms#8566)

* added a problem with solution on sliding window.

* [pre-commit.ci] auto fixes from pre-commit.com hooks

for more information, see https://pre-commit.ci

* added hint for return type and parameter

* [pre-commit.ci] auto fixes from pre-commit.com hooks

for more information, see https://pre-commit.ci

* Update minimum_size_subarray_sum.py

* [pre-commit.ci] auto fixes from pre-commit.com hooks

for more information, see https://pre-commit.ci

* Update minimum_size_subarray_sum.py

* [pre-commit.ci] auto fixes from pre-commit.com hooks

for more information, see https://pre-commit.ci

* Update minimum_size_subarray_sum.py

* Update minimum_size_subarray_sum.py

* [pre-commit.ci] auto fixes from pre-commit.com hooks

for more information, see https://pre-commit.ci

* Update minimum_size_subarray_sum.py

* removed un-necessary docs and added 2 test cases

* Rename sliding_window/minimum_size_subarray_sum.py to dynamic_programming/minimum_size_subarray_sum.py

* Update minimum_size_subarray_sum.py

* [pre-commit.ci] auto fixes from pre-commit.com hooks

for more information, see https://pre-commit.ci

* Update minimum_size_subarray_sum.py

* Update minimum_size_subarray_sum.py

* Update minimum_size_subarray_sum.py

* Update minimum_size_subarray_sum.py

* Update minimum_size_subarray_sum.py

* Update minimum_size_subarray_sum.py

* Update dynamic_programming/minimum_size_subarray_sum.py

Co-authored-by: Christian Clauss <cclauss@me.com>

* Update dynamic_programming/minimum_size_subarray_sum.py

Co-authored-by: Christian Clauss <cclauss@me.com>

* Update dynamic_programming/minimum_size_subarray_sum.py

Co-authored-by: Christian Clauss <cclauss@me.com>

* Update dynamic_programming/minimum_size_subarray_sum.py

Co-authored-by: Christian Clauss <cclauss@me.com>

* Update dynamic_programming/minimum_size_subarray_sum.py

Co-authored-by: Christian Clauss <cclauss@me.com>

* Update dynamic_programming/minimum_size_subarray_sum.py

Co-authored-by: Christian Clauss <cclauss@me.com>

* Update dynamic_programming/minimum_size_subarray_sum.py

Co-authored-by: Christian Clauss <cclauss@me.com>

* Update minimum_size_subarray_sum.py

* [pre-commit.ci] auto fixes from pre-commit.com hooks

for more information, see https://pre-commit.ci

* Fix

* [pre-commit.ci] auto fixes from pre-commit.com hooks

for more information, see https://pre-commit.ci

* Update minimum_size_subarray_sum.py

* [pre-commit.ci] auto fixes from pre-commit.com hooks

for more information, see https://pre-commit.ci

* Update minimum_size_subarray_sum.py

* [pre-commit.ci] auto fixes from pre-commit.com hooks

for more information, see https://pre-commit.ci

* Update minimum_size_subarray_sum.py

* Update minimum_size_subarray_sum.py

* [pre-commit.ci] auto fixes from pre-commit.com hooks

for more information, see https://pre-commit.ci

---------

Co-authored-by: pre-commit-ci[bot] <66853113+pre-commit-ci[bot]@users.noreply.github.com>
Co-authored-by: Christian Clauss <cclauss@me.com>

Author: 3 people

dynamic_programming/minimum_size_subarray_sum.py

@@ -0,0 +1,62 @@
+import sys
+
+
+def minimum_subarray_sum(target: int, numbers: list[int]) -> int:
+    """
+    Return the length of the shortest contiguous subarray in a list of numbers whose sum
+    is at least target.  Reference: https://stackoverflow.com/questions/8269916
+
+    >>> minimum_subarray_sum(7, [2, 3, 1, 2, 4, 3])
+    2
+    >>> minimum_subarray_sum(7, [2, 3, -1, 2, 4, -3])
+    4
+    >>> minimum_subarray_sum(11, [1, 1, 1, 1, 1, 1, 1, 1])
+    0
+    >>> minimum_subarray_sum(10, [1, 2, 3, 4, 5, 6, 7])
+    2
+    >>> minimum_subarray_sum(5, [1, 1, 1, 1, 1, 5])
+    1
+    >>> minimum_subarray_sum(0, [])
+    0
+    >>> minimum_subarray_sum(0, [1, 2, 3])
+    1
+    >>> minimum_subarray_sum(10, [10, 20, 30])
+    1
+    >>> minimum_subarray_sum(7, [1, 1, 1, 1, 1, 1, 10])
+    1
+    >>> minimum_subarray_sum(6, [])
+    0
+    >>> minimum_subarray_sum(2, [1, 2, 3])
+    1
+    >>> minimum_subarray_sum(-6, [])
+    0
+    >>> minimum_subarray_sum(-6, [3, 4, 5])
+    1
+    >>> minimum_subarray_sum(8, None)
+    0
+    >>> minimum_subarray_sum(2, "ABC")
+    Traceback (most recent call last):
+        ...
+    ValueError: numbers must be an iterable of integers
+    """
+    if not numbers:
+        return 0
+    if target == 0 and target in numbers:
+        return 0
+    if not isinstance(numbers, (list, tuple)) or not all(
+        isinstance(number, int) for number in numbers
+    ):
+        raise ValueError("numbers must be an iterable of integers")
+
+    left = right = curr_sum = 0
+    min_len = sys.maxsize
+
+    while right < len(numbers):
+        curr_sum += numbers[right]
+        while curr_sum >= target and left <= right:
+            min_len = min(min_len, right - left + 1)
+            curr_sum -= numbers[left]
+            left += 1
+        right += 1
+
+    return 0 if min_len == sys.maxsize else min_len