<p>You are given an integer array <code>nums</code> and an integer <code>threshold</code>.</p>

<p>Find any subarray of <code>nums</code> of length <code>k</code> such that <strong>every</strong> element in the subarray is <strong>greater</strong> than <code>threshold / k</code>.</p>

<p>Return<em> the <strong>size</strong> of <strong>any</strong> such subarray</em>. If there is no such subarray, return <code>-1</code>.</p>

<p>A <strong>subarray</strong> is a contiguous non-empty sequence of elements within an array.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> nums = [1,3,4,3,1], threshold = 6
<strong>Output:</strong> 3
<strong>Explanation:</strong> The subarray [3,4,3] has a size of 3, and every element is greater than 6 / 3 = 2.
Note that this is the only valid subarray.
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> nums = [6,5,6,5,8], threshold = 7
<strong>Output:</strong> 1
<strong>Explanation:</strong> The subarray [8] has a size of 1, and 8 &gt; 7 / 1 = 7. So 1 is returned.
Note that the subarray [6,5] has a size of 2, and every element is greater than 7 / 2 = 3.5. 
Similarly, the subarrays [6,5,6], [6,5,6,5], [6,5,6,5,8] also satisfy the given conditions.
Therefore, 2, 3, 4, or 5 may also be returned.</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>1 &lt;= nums[i], threshold &lt;= 10<sup>9</sup></code></li>
</ul>

from collections import deque
class Solution:
    def validSubarraySize(self, nums: List[int], threshold: int) -> int:
        stack = deque()
        for i in range(len(nums)):
            if len(stack) == 0:
                stack.append([nums[i], i])
            else:
                while len(stack) != 0 and nums[i] < stack[-1][0]:
                    tmp = stack.pop()
                    prevInd = -1
                    if len(stack) > 0:
                        prevInd = stack[-1][1]
                    subLen = i - prevInd - 1
                    subThresh = threshold / subLen
                    # print(i, subLen, subThresh)
                    if tmp[0] > subThresh:
                        return subLen
                stack.append([nums[i], i])
        for i in range(len(stack)):
            if i == 0:
                subLen = len(nums)
                subThresh = threshold / subLen
                if stack[i][0] > subThresh:
                    return subLen
            # print('sub', stack[i], len(nums))
            subLen = len(nums) - stack[i - 1][1] - 1
            if subLen == 0:
                continue
            subThresh = threshold / subLen
            # print('sub', stack[i], len(nums), subLen, subThresh)
            if stack[i][0] > subThresh:
                return subLen
        return -1
35400