Given an integer array nums and two integers lower and upper, return the number of range sums that lie within the inclusive interval $[$lower, upper$]$.

A range sum $S(i, j)$ is defined as the sum of the elements in nums from index i to index j inclusive, where $0 \leq i \leq j <$ nums.length.

Constraints:

• $1 \leq$ nums.length $\leq 10^5$

• $-2^{31} \leq$ nums[i] $\leq 2^{31} - 1$

• $-10^5 \leq$ lower $\leq$ upper $\leq 10^5$

• The answer is guaranteed to fit in a $32$ bit integer.

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.