Given an array of distinct integers A[ ], write a program to 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 [i, j] follows :
- i , j are from A[ ]
- i < j
- j - i equals to the minimum absolute difference of any two elements in A[ ].
Input: A = [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.
Input: A = [1,3,6,10,15] Output: [[1,3]]
Input: A = [3,8,-10,23,19,-4,-14,27] Output: [[-14,-10],[19,23],[23,27]]