Hello **Programmers/Coders,** Today we are going to share ** solutions of Programming problems of HackerRank, Algorithm Solutions of Problem Solving Section in Java**. At Each Problem with Successful submission with

**all Test Cases Passed,**you will get an score or marks. And after solving maximum problems, you will be getting stars. This will highlight your profile to the recruiters.

In this post, you will find the solution for **Minimum Absolute Difference in an Array** **in Java-HackerRank Problem**. We are providing the **correct and tested solutions** of coding problems present on **HackerRank**. If you are not able to solve any problem, then you can take help from our Blog/website.

Use “Ctrl+F” To Find Any Questions Answer. & For Mobile User, You Just Need To Click On Three dots In Your Browser & You Will Get A “Find” Option There. Use These Option to Get Any Random Questions Answer.

**Introduction To Algorithm**

The word **Algorithm** means “a process or set of rules to be followed in calculations or other problem-solving operations”. Therefore Algorithm refers to a set of rules/instructions that step-by-step define how a work is to be executed upon in order to get the expected results.

**Advantages of Algorithms:**

- It is easy to understand.
- Algorithm is a step-wise representation of a solution to a given problem.
- In Algorithm the problem is broken down into smaller pieces or steps hence, it is easier for the programmer to convert it into an actual program.

** Link for the Problem** – Minimum Absolute Difference in an Array – Hacker Rank Solution

Minimum Absolute Difference in an Array – Hacker Rank Solution

**Problem:**

**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):

*int arr[n]:*an array of integers

**Returns**

*int:*the minimum absolute difference found

**Input Format**

**Sample Input 0**

3 3 -7 0

**Sample Output 0**

3

**Explanation 0**

**Sample Input 1**

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

**Sample Output 1**

1

**Explanation 1**

Minimum Absolute Difference in an Array – Hacker Rank Solution

import java.io.*; import java.util.*; import java.text.*; import java.math.*; import java.util.regex.*; public class Solution { public static void main(String[] args) { Scanner in = new Scanner(System.in); int n = in.nextInt(); int[] a = new int[n]; for(int a_i=0; a_i < n; a_i++){ a[a_i] = in.nextInt(); } Arrays.sort(a); int min = 2000000000; for (int i = 1; i < n; i++) { min = Math.min(Math.abs(a[i]-a[i-1]), min); } System.out.println(min); } }