minimum-absolute-difference

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

Algorithms

Given an array of distinct integers <code>arr</code>, 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), each pair <code>[a, b]</code> follows

<ul>
	<li><code>a, b</code> are from <code>arr</code></li>
	<li><code>a &lt; b</code></li>
	<li><code>b - a</code> equals to the minimum absolute difference of any two elements in <code>arr</code></li>
</ul>

&nbsp;
Example 1:

<pre>
Input: arr = [4,2,1,3]
Output: [[1,2],[2,3],[3,4]]
Explanation: The minimum absolute difference is 1. List all pairs with difference equal to 1 in ascending order.</pre>

Example 2:

<pre>
Input: arr = [1,3,6,10,15]
Output: [[1,3]]
</pre>

Example 3:

<pre>
Input: arr = [3,8,-10,23,19,-4,-14,27]
Output: [[-14,-10],[19,23],[23,27]]
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>2 &lt;= arr.length &lt;= 105</code></li>
	<li><code>-106 &lt;= arr[i] &lt;= 106</code></li>
</ul>