Count Subarrays With Score Less Than K
Count the number of non-empty subarrays in a given positive integer array nums such that the product of the sum of elements and the length of the subarray is strictly less than the given integer k.
For example, if nums = [1, 2, 3, 4, 5] and k = 75, the output should be the number of subarrays whose product of sum and length is less than 75.
Print the count of such subarrays.
Ada AI
I want to discuss a solution
Help me solve this
Give more examples
What's wrong with my code?
How to use 'for loop' in javascript?
javascript (node 13.12.0)