LeetCode 327 Count of Range Sum - Problem Statement

Input: Array and range [lower, upper].

Output: Count of subarray sums within range.

Example: Count subarrays with sum in $[lower, upper]$.

Constraints: $1 \le$ nums.length $\le 10^5$. $-10^5 \le$ lower $\le$ upper $\le 10^5$.