#1822Medium#7 in Agoda's list· asked at 10 companies
Subarray Product Less Than K
Hosted on LeetCode
Solve it on LeetCode, track it here.
This problem's full statement lives on LeetCode. Open it in a new tab, then come back to mark it solved, add notes and keep your streak.
LeetCode Premium locked?
Most company-tagged LeetCode problems are behind Premium. If you have ChatGPT Plus or Claude Pro, ask it for the full statement, examples and constraints. The buttons below open a chat with the prompt already filled in.
What we know
Example 1
Input: nums = [10,5,2,6], k = 100 Output: 8
[10], [5], [2], [6], [10,5], [5,2], [2,6], [5,2,6].
Example 2
Input: nums = [1,2,3], k = 0 Output: 0
Constraints
- •
1 <= nums.length <= 3 * 10^4 - •
1 <= nums[i] <= 1000 - •
0 <= k <= 10^6