Grokking the Coding Interview Patterns/

...

/

Count Subarrays With Score Less Than K

Count Subarrays With Score Less Than K

Try to solve the Count Subarrays With Score Less Than K problem.

We'll cover the following...

Statement

An array score is defined as the sum of the array elements multiplied by its length. For example, if the array is [2,1,5][2, 1, 5], then its score is (2+1+5)×3(2 + 1 + 5) \times 3 ...