Count Contiguous Subarrays Below Threshold

Question

Given an array of integers `values` and two integers `n` and `k`, count all contiguous subarrays of size `n` where the product of its elements is less than `k`.

DSAMaster · Accepted Answer

To optimally solve the Count Contiguous Subarrays Below Threshold problem involving Two Pointers, it is important to analyze constraints. Time Complexity: O(N), Space Complexity: O(1). Two pointers. Expand right, multiply product. While product >= k, divide by left element and shrink left. Number of valid subarrays ending at 'right' is (right - left + 1). Sum these up. Time O(N), Space O(1).

Count Contiguous Subarrays Below Threshold Solution

Problem Statement

Constraints

Run, Test & Submit Code

Tested Solutions

Related Problems