Minimum Absolute Difference in an Array
Source : Hackerrank
Consider an array of integers, . We define the absolute difference between two elements, and (where ), to be the absolute value of .
Given an array of n integers, find and print the minimum absolute difference between any two elements in the array.
The first line contains a single integer denoting (the number of integers).
The second line contains space-separated integers describing the respective values of .
Print the minimum absolute difference between any two elements in the array.
Sample Input 0
3 3 -7 0
Sample Output 0
With integers in our array, we have three possible pairs: , , and . The absolute values of the differences between these pairs are as follows:
Notice that if we were to switch the order of the numbers in these pairs, the resulting absolute values would still be the same. The smallest of these possible absolute differences is , so we print as our answer.
Tried the problem. All the test cases are passed, only last 2 are getting TLE. Working on the solution to optimize it further.