Minimum Absolute Difference in an Array HackerRank Solution

Minimum Absolute Difference in an Array HackerRank Solution
Source : https://www.hackerrank.com/challenges/minimum-absolute-difference-in-an-array

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 integers, find and print the minimum absolute difference between any two elements in the array. For example, given the array we can create pairs of numbers: and . The absolute differences for these pairs are , and . The minimum absolute difference is .

Function Description

Complete the minimumAbsoluteDifference function in the editor below. It should return an integer that represents the minimum absolute difference between any pair of elements.

minimumAbsoluteDifference has the following parameter(s):

• n: an integer that represents the length of arr
• arr: an array of integers

Input Format

The first line contains a single integer , the size of .
The second line contains space-separated integers .

Constraints

Output Format

Print the minimum absolute difference between any two elements in the array.

Sample Input 0

33 -7 0

Sample Output 0

3

Explanation 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 .

Sample Input 1

10-59 -36 -13 1 -53 -92 -2 -96 -54 75

Sample Output 1

1

Explanation 1

The smallest absolute difference is .

Sample Input 2

51 -3 71 68 17

Sample Output 2

3

Explanation 2

The minimum absolute difference is .

Source : https://www.hackerrank.com/challenges/minimum-absolute-difference-in-an-array

Solution

	// Karthikalapati.blogspot.com
	import java.util.Scanner;
	import java.util.Arrays;
	// Algorithm: Sort the array and compare adjacent pairs
	// Greedy algorithm? No
	// A greedy algorithm makes "the locally optimal choice at each
	// stage with the hope of finding a global optimum" - Wikipedia
	public class Solution {
	public static void main(String[] args) {
	Scanner scan = new Scanner(System.in);
	int n = scan.nextInt();
	int [] array = new int[n];
	for (int i = 0; i < n; i++) {
	array[i] = scan.nextInt();
	}
	scan.close();
	System.out.println(minAbsoluteDifference(array));
	}
	private static int minAbsoluteDifference(int [] array) {
	Arrays.sort(array);
	int min = Integer.MAX_VALUE;
	for (int i = 1; i < array.length; i++) {
	min = Math.min(min, Math.abs(array[i] - array[i-1]));
	}
	return min;
	}
	}