Revolut | Graduate Software Engineer (Junior/New Grad) | Coding | Online Assessment

Question 2: Count Subarrays With Product at Most K You are given an array of positive integers nums and a positive integer k. Return the number of contiguous subarrays whose product is less than or equal to k. A subarray is a non empty, contiguous sequence of elements from the original array. Example 1 Input: nums = [10, 5, 2, 6] k = 100 Output: 9 Explanation: The valid subarrays are: [10] [5] [2] [6] [10, 5] [5, 2]...