subarray-with-elements-greater-than-varying-threshold

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

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

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

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

A subarray is a contiguous non-empty sequence of elements within an array.

&nbsp;
Example 1:

<pre>
Input: nums = [1,3,4,3,1], threshold = 6
Output: 3
Explanation: 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>

Example 2:

<pre>
Input: nums = [6,5,6,5,8], threshold = 7
Output: 1
Explanation: 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>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= nums.length &lt;= 105</code></li>
	<li><code>1 &lt;= nums[i], threshold &lt;= 109</code></li>
</ul>

validSubarraySize

Subarray With Elements Greater Than Varying Threshold

Maximum Subarray Min-Product

maximum-subarray-min-product

子数组最小乘积的最大值

Smallest K-Length Subsequence With Occurrences of a Letter

smallest-k-length-subsequence-with-occurrences-of-a-letter

含特定字母的最小子序列

K Divisible Elements Subarrays

k-divisible-elements-subarrays

含最多 K 个可整除元素的子数组

Stack

Union Find

Array

Monotonic Stack

给你一个整数数组&nbsp;<code>nums</code>&nbsp;和一个整数&nbsp;<code>threshold</code>&nbsp;。

找到长度为 <code>k</code>&nbsp;的&nbsp;<code>nums</code>&nbsp;子数组，满足数组中&nbsp;每个&nbsp;元素都 大于&nbsp;<code>threshold / k</code>&nbsp;。

请你返回满足要求的 任意&nbsp;子数组的 大小&nbsp;。如果没有这样的子数组，返回&nbsp;<code>-1</code>&nbsp;。

子数组 是数组中一段连续非空的元素序列。

&nbsp;

示例 1：

<pre>输入：nums = [1,3,4,3,1], threshold = 6
输出：3
解释：子数组 [3,4,3] 大小为 3 ，每个元素都大于 6 / 3 = 2 。
注意这是唯一合法的子数组。
</pre>

示例 2：

<pre>输入：nums = [6,5,6,5,8], threshold = 7
输出：1
解释：子数组 [8] 大小为 1 ，且 8 &gt; 7 / 1 = 7 。所以返回 1 。
注意子数组 [6,5] 大小为 2 ，每个元素都大于 7 / 2 = 3.5 。
类似的，子数组 [6,5,6] ，[6,5,6,5] ，[6,5,6,5,8] 都是符合条件的子数组。
所以返回 2, 3, 4 和 5 都可以。</pre>

&nbsp;

提示：

<ul>
	<li><code>1 &lt;= nums.length &lt;= 105</code></li>
	<li><code>1 &lt;= nums[i], threshold &lt;= 109</code></li>
</ul>