<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>

class Solution:
    def validSubarraySize(self, nums: List[int], threshold: int) -> int:
        prevStack = []
        prevIndex = []
        kMin =[]
        for i,n in enumerate(nums):
            kVal = threshold//n+1
            kMin.append(kVal)

            if len(prevStack)==0:
                # meaning no previous values smaller 
                # add -1 as prevIndex
                prevIndex.append(-1)
                prevStack.append((i,n))
            else:
                while(prevStack and prevStack[-1][1]>=n):
                    prevStack.pop()
                if(len(prevStack)==0):
                    prevIndex.append(-1)
                else:
                    prevIndex.append(prevStack[-1][0])
                prevStack.append((i,n))
        
        nextStack = []
        nextIndex =[]

        for i in range(len(nums)-1,-1,-1):
            n = nums[i]
            if len(nextStack)==0:
                nextIndex.append(len(nums))
                nextStack.append((i,n))
            else:
                while(nextStack and nextStack[-1][1]>=n):
                    nextStack.pop()
                if(len(nextStack)==0):
                    nextIndex.append(len(nums))
                else:
                    nextIndex.append(nextStack[-1][0])
                nextStack.append((i,n))
        nextIndex.reverse()
        print(prevIndex)
        print(nextIndex)
        print(kMin)
        ans = -1
        for i in range(len(nums)):
            val = nextIndex[i]-prevIndex[i]-1
            if(val>=kMin[i]):
                ans = max(ans,val)
      

        return ans
1141