You are given an integer array nums and an integer threshold. Return the size k of any non empty contiguous subarray such that every element in that subarray is strictly greater than threshold / k.

If no such subarray exists, return $-1$.

Note: If multiple subarrays satisfy the condition, you may return the size of any one of them.

Constraints:

• $1 \leq$ nums.length $\leq 10^5$

• $1 \leq$ nums[i], threshold $\leq 10^9$

Input: nums = [2,2,2,2]-List[int], threshold = 9-int
Output: -1-int
Explanation: Any subarray of size k has all elements equal to 2, and the condition requires 2 > 9 / k. For k=1, 2 > 9 is false; for k=2, 2 > 4.5 is false; for k=3, 2 > 3 is false; and for k=4, 2 > 2.25 is false. No valid subarray exists.

Input: nums = [9,1,9,1,9]-List[int], threshold = 8-int
Output: 1-int
Explanation: Choose any single-element subarray containing 9, e.g., [9]. For k=1, we need 9 > 8 / 1 = 8, which is true.

Input: nums = [4,4,4,4,4,4]-List[int], threshold = 20-int
Output: 6-int
Explanation: Take the whole array as the subarray, so k=6. Every element 4 must satisfy 4 > 20 / 6 ≈ 3.33, which is true for all elements, so a valid answer is 6.

Input: nums = [1000000000]-List[int], threshold = 999999999-int
Output: 1-int
Explanation: The only subarray is [1000000000] with k=1. Since 1000000000 > 999999999 / 1 = 999999999 is true, we return 1.

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.