Count Subarrays With Score Less Than K

Understand how to efficiently count subarrays whose score, defined as the sum of elements times their length, is less than a given threshold k. Explore applying the sliding window pattern to solve this problem with positive integer arrays.