Given a $0$ indexed integer array nums, determine an array answer of the same length such that:

answer[i] = |leftSum[i] - rightSum[i]|

Where:

• leftSum[i] represents the sum of elements located to the left of index i in nums. If no elements exist to the left, leftSum[i] = 0.

• rightSum[i] represents the sum of elements located to the right of index i in nums. If no elements exist to the right, rightSum[i] = 0.

Return the array answer.

Constraints:

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

• $1 \leq$ nums[i] $\leq 10^5$

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.