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

|

697 Discussions

|

  • amanjindal174
     + 0 comments
    int minimumAbsoluteDifference(vector<int> arr) {
    
    // Sort the array first
    sort(arr.begin(), arr.end());
    
    // Initialize the minimum difference with a large value
    int ans = abs(arr[1] - arr[0]);

    // Compare consecutive elements for the minimum difference
    for (int i = 1; i < arr.size() - 1; i++) {
        ans = min(ans, abs(arr[i + 1] - arr[i]));
    }

    return ans;
}

  • ricardo1512
     + 0 comments
    def minimumAbsoluteDifference(arr):
    minimum = 10e10
    Arr = sorted(arr)
    for i in range(1, len(Arr)):
        minimum = min(minimum, abs(Arr[i] - Arr[i-1]))
        if minimum == 0:
            return 0
    return minimum

  • HeroMinhSteve
     + 0 comments

    Here is my solution for this (C++)

    include

    define ll long long

    define minimize(a,b) a=min(a,b)

    const ll MOD = (ll) 1e18+3; using namespace std; ll n,a[100001],ans=1e9+1; void fastip(){ ios_base::sync_with_stdio(0); cin.tie(0);cout.tie(0); }

    int main(){ fastip(); cin>> n; for (int i=0;i>a[i]; } sort(a,a+n); for (int i=1;i

  • 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;
}

  • shreyavishwalin1
     + 0 comments
    def minimumAbsoluteDifference(arr):
    # Sort the array
    arr.sort()
    
    # Initialize the minimum difference as a large number
    min_diff = float('inf')
    
    # Traverse the sorted array and find the minimum difference
    for i in range(len(arr) - 1):
        diff = abs(arr[i] - arr[i + 1])
        if diff < min_diff:
            min_diff = diff
    
    return min_diff