Subarray Product Less Than K at Salesforce
Medium53.9% acceptance
This problem has 75.0% frequency at Salesforce.
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 Salesforce Questions
Maximum Number of Occurrences of a SubstringMediumSmallest Substring With Identical Characters IHardSmallest Substring With Identical Characters IIHardClosest Equal Element QueriesMediumLongest Substring Without Repeating CharactersMedium
View all Salesforce questions