Skip to content

Practice Sum of Absolute Differences in a Sorted Array

Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.

Medium#1685
LeetCode Problem

Sum of Absolute Differences in a Sorted Array

Problem Statement

You are given an integer array nums sorted in non-decreasing order. Build and return an integer array result with the same length as nums such that result[i] is equal to the summation of absolute differences between nums[i] and all the other elements in the array. In other words, result[i] is equal to sum(|nums[i]-nums[j]|) where 0 <= j < nums.length and j != i (0-indexed).

Source: Sum of Absolute Differences in a Sorted Array on LeetCode. Use the original task for its coding environment and submissions.

Examples

# Example 1

Input
nums = [2,3,5]
Output
[4,3,5]

# Example 2

Input
nums = [1,4,6,8,10]
Output
[24,15,13,15,21]

Constraints

2 <= nums.length <= 10^5
1 <= nums[i] <= nums[i + 1] <= 10^4

Related LeetCode Problems

Practice more problems similar to Sum of Absolute Differences in a Sorted Array.

Review your practice with PhantomCodeAI

After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.