Leetcode Problem 1200. Minimum Absolute Difference

1200. Minimum Absolute Difference

Leetcode Solutions

Sort + Traversal

  1. Sort the input array arr.
  2. Initialize minPairDiff to a large number and an empty list result to store the pairs.
  3. Traverse the sorted array and for each pair of adjacent elements, calculate the absolute difference currPairDiff.
  4. If currPairDiff is less than minPairDiff, update minPairDiff and reset result to only contain the current pair.
  5. If currPairDiff is equal to minPairDiff, append the current pair to result.
  6. Continue until all adjacent pairs have been checked.
  7. Return the result list containing all pairs with the minimum absolute difference.
UML Thumbnail

Brute Force Approach

Ask Question

Programming Language
image/screenshot of info(optional)
Full Screen
Loading...

Suggested Answer

Answer
Full Screen
Copy Answer Code
Loading...