Sponsored
Sponsored
Use these hints if you're stuck. Try solving on your own first.
If we add an element to a list of elements, how will the score change?
How can we use this to determine the number of subarrays with score less than k in a given range?
How can we use “Two Pointers” to generalize the solution, and thus count all possible subarrays?