Practice Subarray Product Less Than K
Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.
Problem Statement
Given an array of integers nums and an integer k, return the number of contiguous subarrays where the product of all the elements in the subarray is strictly less than k.
Source: Subarray Product Less Than K on LeetCode. Use the original task for its coding environment and submissions.
Examples
# Example 1
Input
nums = [10,5,2,6], k = 100
Output
8
# 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
Related LeetCode Problems
Practice more problems similar to Subarray Product Less Than K.
Review your practice with PhantomCodeAI
After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.