Minimum Absolute Difference

Given an array of distinct integers arr, find all pairs of elements with the minimum absolute difference of any two elements.

Return a list of pairs in ascending order (with respect to pairs), where each pair [a, b] follows:

  • a and b are from arr
  • a < b
  • b - a equals the minimum absolute difference of any two elements in arr
Example 1
Inputarr = [4,2,1,3]
Output[[1,2],[2,3],[3,4]]
The minimum absolute difference is 1, so all pairs with difference equal to 1 are returned in ascending order.
Example 2
Inputarr = [1,3,6,10,15]
Output[[1,3]]
The minimum absolute difference is 2, and the only pair with that difference is [1, 3].

Constraints

  • 2 <= arr.length <= 10^5
  • -10^6 <= arr[i] <= 10^6

Asked at 15 companies

</>

Your Solution

(Ctrl/Cmd + Enter)

Switching Language

Loading template...

Loading...

Sign in to save your progress

AI code evaluation

Get a correctness verdict, missed edge cases, and complexity analysis of your solution.

Sign in to evaluate