NeetCode #245LC-713MediumSliding Window
← Back to All Problems#245 · #713 · Subarray Product Less Than K(乘积小于 K 的子数组)
📌 Problem Statement & Constraints
Given an array of integers
nums and an integer k, return the number of contiguous subarrays where the product of all elements is strictly less than k. Constraints: 1 <= nums.length <= 3 * 10^4, 1 <= nums[i] <= 1000, 0 <= k <= 10^6.🔒
Sign In to Unlock Full Solutions for All 973 Problems
Sign in to access step-by-step logic, benchmark Python3 code, complexity breakdown, and offline export!