Documentation Index
Fetch the complete documentation index at: /llms.txt
Use this file to discover all available pages before exploring further.
Tested Python solution for LeetCode 713 with 16 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 713 # by problem number
lcpy gen -s subarray_product_less_than_k # by problem name
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.
Input: nums = [10,5,2,6], k = 100
Output: 8
Explanation: 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
class Solution:
# Time: O(n)
# Space: O(1)
def num_subarray_product_less_than_k(self, nums: list[int], k: int) -> int:
if k <= 1:
return 0
product = 1
left = 0
count = 0
for right, val in enumerate(nums):
product *= val
while product >= k:
product //= nums[left]
left += 1
count += right - left + 1
return count
| Time | Space |
|---|---|
| O(n) | O(1) |