Leetcode 713. Subarray Product Less Than K
Count the number of contiguous subarrays of positive integers whose product is strictly less than k. Because all nums > 0, this is a sliding-window/two-pointer problem maintaining a running product (with the quick edge case that k ≤ 1 yields 0).
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Your account is free and you can post anonymously if you choose.