Subarray Product Less Than K
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.
Example 1
Input
nums = [10,5,2,6], k = 100Output
8The 8 subarrays with product less than 100 are [10], [5], [2], [6], [10, 5], [5, 2], [2, 6], and [5, 2, 6]; [10, 5, 2] is not included because its product is 100, which is not strictly less than k.
Example 2
Input
nums = [1,2,3], k = 0Output
0No contiguous subarray can have a positive product strictly less than 0.
Constraints
- 1 <= nums.length <= 3 * 10^4
- 1 <= nums[i] <= 1000
- 0 <= k <= 10^6
Asked at 19 companies
Practice questions like this out loud in a mock coding interview with a live AI interviewer. First one free.