You are given an integer array nums of size n.

For each index i where $0 \leq$ i $<$ n, consider the subarray nums[start ... i] where start $= \max(0,$ i $-$ nums[i]$)$.

Return the total sum of the elements of all such subarrays.

Constraints:

• $1 \leq$ n $==$ nums.length $\leq 100$

• $1 \leq$ nums[i] $\leq 1000$

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.