Problem: Count Subarrays With Score Less Than K

Medium

30 min

Explore how to use the sliding window approach to count non-empty subarrays where the score, defined as the sum of elements multiplied by subarray length, is less than a given value k. This lesson helps you understand the problem constraints and apply an efficient algorithm to solve such array challenges.

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}$
$1 \leq$ nums[i] $\leq 10^{3}$
$1 \leq$ k $\leq 10^{5}$

Problem: Count Subarrays With Score Less Than K

Medium

30 min

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}$
$1 \leq$ nums[i] $\leq 10^{3}$
$1 \leq$ k $\leq 10^{5}$

Problem: Count Subarrays With Score Less Than K

Statement

Examples

Understand the problem

Figure it out!

Try it yourself

Problem: Count Subarrays With Score Less Than K

Statement

Examples

Understand the problem

Figure it out!

Try it yourself