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).
Asked at:
Apple
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
Early October, 2026
Apple
Senior
Then a follow up was asked to give the count when the subarray product is equal to k. The third follow up was to print the subarray when subarrays are <= k.
Early September, 2026
Apple
Senior
Mid December, 2025
Apple
Senior
Hello Interview Premium
Your account is free and you can post anonymously if you choose.