Subarrays with product limit
Given an array of positive integers nums and an integer k, return the number of contiguous subarrays whose product is strictly less than k. Array length up to 3e4, values >= 1.
Implement
num_subarray_product_less_than_k(nums: list[int], k: int) → intExamples
in
[[10,5,2,6],100]out8What a strong answer looks like
State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
0:00 of about 22 min
solution.py
InputExpectedGot
[[10,5,2,6],100]8not run yetsample