Subarray Product Less Than K

Medium

Problem

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.

Constraints

1 <= nums.length <= 3 * 10^4
1 <= nums[i] <= 1000
0 <= k <= 10^6

Examples

Input: nums = [10, 5, 2, 6], k = 100

Output: 8

The 8 subarrays that have product less than 100 are: [10], [5], [2], [6], [10, 5], [5, 2], [2, 6], [5, 2, 6]. Note that [10, 5, 2] is not included as the product of 100 is not strictly less than k.

Input: nums = [1, 2, 3], k = 0

Output: 0

Since k = 0, no product of positive integers can be less than 0, so the answer is 0.

Loading...

Loading Python...