Given an integer array nums, return an array ans of the same length where each element ans[i] equals the sum of nums[0] through nums[i] (inclusive). This is the running prefix sum of nums.

Constraints:

• $1 \leq$ nums.length $\leq 1000$

• $-10^6 \leq$ nums[i] $\leq 10^6$

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.