Solution: Count Subarrays With Score Less Than K

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]$, then its score is $(2 + 1 + 5) \times 3$ = $24$.

Given an array of positive integers, nums, and a positive integer k, count and return the number of non-empty subarrays of nums whose score is strictly less than k.

Note: A subarray is a contiguous sequence of elements within an array.

Constraints:

• $1 \leq$ nums.length $\leq 10^{3}$ ...