<p>Given an integer array <code>nums</code> and an integer <code>k</code>, return <em>the length of the shortest non-empty <strong>subarray</strong> of </em><code>nums</code><em> with a sum of at least </em><code>k</code>. If there is no such <strong>subarray</strong>, return <code>-1</code>.</p>

<p>A <strong>subarray</strong> is a <strong>contiguous</strong> part of an array.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>
<pre><strong>Input:</strong> nums = [1], k = 1
<strong>Output:</strong> 1
</pre><p><strong class="example">Example 2:</strong></p>
<pre><strong>Input:</strong> nums = [1,2], k = 4
<strong>Output:</strong> -1
</pre><p><strong class="example">Example 3:</strong></p>
<pre><strong>Input:</strong> nums = [2,-1,2], k = 3
<strong>Output:</strong> 3
</pre>
<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= nums.length &lt;= 10<sup>5</sup></code></li>
	<li><code>-10<sup>5</sup> &lt;= nums[i] &lt;= 10<sup>5</sup></code></li>
	<li><code>1 &lt;= k &lt;= 10<sup>9</sup></code></li>
</ul>

class Solution:
    def shortestSubarray(self, nums: List[int], k: int) -> int:
        # brute force
        # [1,2,3,4] # 10 -> 
        # [1,2,3,4, -9999]
        m = collections.deque()
        total = 0 
        res = float('inf')
        temp_res = 0 
        for index in range(len(nums)):
            total += nums[index]
            if total <= 0:
                m = d = collections.deque()
                total = 0
                temp_res = 0
                continue 
            
            temp_res +=1 
            temp_val = nums[index] 
            c = 1 
            while temp_val <= 0: 
                n = m.pop()
                temp_val += n[0]
                c += n[1]

            m.append((temp_val,c)) 
            while k <= total: 
                if k <= total:
                    res = min(res, temp_res)
                n = m.popleft()
                total -= n[0]
                temp_res -= n[1] 
        if res == float('inf'):
            return -1 
        return res 
31200