2334. Subarray With Elements Greater Than Varying Threshold

LeetCodeArrayStackUnion-FindMonotonic StackOpen on judge ↗

You are given an integer array nums and an integer threshold. Find any subarray of nums of length k such that every element in the subarray is greater than threshold / k. Return the size of any such subarray. If there is no such subarray, return -1. A subarray is a contiguous non-empty sequence of elements within an array. Example 1: Input: nums = [1,3,4,3,1], threshold = 6 Output: 3 Explan

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI