https://leetcode.com/problems/minimum-size-subarray-sum/



Time Limit Exceeded



```python
class Solution:
    def minSubArrayLen(self, target: int, nums: List[int]) -> int:
        #8:42
        total_length = len(nums) - 1
        self.found = []
        def grow_to_find(start_index, length, current_sum):
            current_index = start_index + length
            #print(current_index, length)
            if current_index > total_length:
                return
            current_number = nums[current_index]
            new_sum = current_sum + current_number
            if (new_sum >= target):
                self.found.append(length+1)
                return
            else:
                grow_to_find(start_index, length+1, new_sum)
                
        for index, num in enumerate(nums):
            grow_to_find(index, 0, 0)
            
        if (len(self.found) == 0):
            return 0
        return min(self.found)
        #8:51
        #debug until 8:56
```

___

> Work in private. (So they won't steal your idea, take your wealth.
