Given an integer array nums sorted in nondecreasing order.

Build and return an integer array result of the same length, where result[i] is equal to the sum of the absolute differences between nums[i] and every element in nums.

In other words, result[i] is equal to $\sum |$nums[i] $-$ nums[j]$|$ for all $0 \leq$ j $<$ nums.length.

Constraints:

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

• $1 \leq$ nums[i] $\leq$ nums[i + 1] $\leq 10^4$

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.