Subarray Product Less Than K at Squarepoint Capital
Medium53.9% acceptance
This problem has 75.0% frequency at Squarepoint Capital.
Problem Description
Given an array of integers `nums` and an integer `k`, return _the number of contiguous subarrays where the product of all the elements in the subarray is strictly less than_`k`.
Read full problem and hintsTopics
Also asked at 20 companies
More Squarepoint Capital Questions
Search Suggestions SystemMediumBest Time to Buy and Sell StockEasyMaximum SubarrayMediumLongest Increasing SubsequenceMediumFrog JumpHard
View all Squarepoint Capital questions