Problem Brief

Range Sum

INTERNOA

Return the number of range sums that lie in [lower, upper] inclusive.

1Example 1

Input

arr = [-2, 5, -1], lower = -2, upper = 2

Output

Explanation

There are three ranges with sums that fall within the range [-2, 2]: 1. [-2] with sum -2 2. [-2, 5, -1] with sum 2 3. [-1] with sum -1

Input

arr = [1, -3, 5, 2, 5, 2, -5], lower = -2, upper = 6

Output

Explanation

There are eight ranges with sums that fall within the range [-2, 6].

Input

arr = [1, -3, 5, -2, 2, 5, -1, 10], lower = 5, upper = 9

Output

Explanation

There are twelve ranges with sums that fall within the range [5, 9].

Limits and guarantees your solution can rely on.

🍉🍉

Draft autosaves locally

public int rangeSum(int[] arr, int lower, int upper) {
  // write your code here
}

Input

arr

[-2, 5, -1]

lower

-2

upper

Output