We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Algorithms
  3. Greedy
  4. Minimum Absolute Difference in an Array
  5. Discussions

Minimum Absolute Difference in an Array

Sort by

recency

|

703 Discussions

|

  • alban_tyrex
     + 0 comments

    Here is my c++ solution, you can find the explanation here : https://youtu.be/6SnD7A1TbJQ

    int minimumAbsoluteDifference(vector<int> arr) {
    sort(arr.begin(), arr.end());
    int result = INT_MAX;
    for(int i = 1; i < arr.size(); i++){
        int d = arr[i] - arr[i-1];
        if( d < result) result = d;
    }
    return result;
}

  • emhhacker
     + 0 comments

    My Java solution with o(n log n + n) time complexity and o(1) space:

    public static int minimumAbsoluteDifference(List<Integer> arr) {
        // goal: determine the min abs val between any two pairs in arr
        Collections.sort(arr); //sort arr ascending
        int min = Integer.MAX_VALUE;
        for(int i = 1; i < arr.size(); i++){
            int currentMin = arr.get(i) - arr.get(i - 1); 
            if(currentMin < min) min = currentMin;
        }
        return min;
    }

  • patrickgao2020
     + 0 comments

    Here is my Python solution!

    def minimumAbsoluteDifference(arr):
    arr.sort()
    differences = []
    for i in range(1, len(arr)):
        differences.append(abs(arr[i] - arr[i - 1]))
    return min(differences)

  • wilson155079
     + 0 comments
        public static int minimumAbsoluteDifference(List<Integer> arr) {
        // Sort the array
        Collections.sort(arr); 
        
        int absMin = Integer.MAX_VALUE;
        for (int i = 1; i < arr.size(); i++) {
            int absDiff = Math.abs(arr.get(i) - arr.get(i - 1));
            absMin = Math.min(absMin, absDiff);
        }
        
        return absMin;
    }

  • dorirgob
     + 0 comments

    Java:

    public static int minimumAbsoluteDifference(List<Integer> arr) {
    if (arr == null || arr.size() < 2) {
      throw new IllegalArgumentException(
          "Array must contain at least two elements.");
    }
    Collections.sort(arr);
    //System.out.println(arr);
    int n = arr.size();
    int minAbsDiff = Integer.MAX_VALUE;

    for (int i = 0; i < n - 1; i++) {
      int abs = arr.get(i + 1) - arr.get(i);
      minAbsDiff = Math.min(minAbsDiff, abs);
    }

    return minAbsDiff;
  }