# Solving Leetcode Interviews in Seconds with AI: Minimum Absolute Difference


	# Introduction
	In this blog post, we will explore how to solve the LeetCode problem "1200" using AI. LeetCode is a popular platform for preparing for coding interviews, and with the help of AI tools like [Chatmagic](https://www.chatmagic.app), we can generate solutions quickly and efficiently - helping you pass the interviews and get the job offer without having to study for months.

	# Problem Statement
	> Given an array of distinct integers arr, find all pairs of elements with the minimum absolute difference of any two elements. Return a list of pairs in ascending order(with respect to pairs), each pair [a, b] follows  a, b are from arr a < b b - a equals to the minimum absolute difference of any two elements in arr    Example 1:  Input: arr = [4,2,1,3] Output: [[1,2],[2,3],[3,4]] Explanation: The minimum absolute difference is 1. List all pairs with difference equal to 1 in ascending order. Example 2:  Input: arr = [1,3,6,10,15] Output: [[1,3]]  Example 3:  Input: arr = [3,8,-10,23,19,-4,-14,27] Output: [[-14,-10],[19,23],[23,27]]    Constraints:  2 <= arr.length <= 105 -106 <= arr[i] <= 106  

	# Explanation
	Here's the breakdown of the approach, complexities, and the Python code:

*   **Sort the array:** Sorting allows us to efficiently compare adjacent elements to find the minimum absolute difference.
*   **Find the minimum difference:** Iterate through the sorted array, calculating the difference between adjacent elements and updating the minimum difference found so far.
*   **Collect pairs with the minimum difference:** Iterate through the sorted array again, and add pairs of adjacent elements whose difference equals the minimum difference to the result list.

*   **Runtime Complexity: O(n log n)**, dominated by the sorting step. **Storage Complexity: O(n)**, primarily due to the space used for sorting (in-place sorts can reduce this).

	
	# Code
	```python
	def minimumAbsDifference(arr):
    """
    Finds all pairs of elements with the minimum absolute difference of any two elements.

    Args:
        arr: A list of distinct integers.

    Returns:
        A list of pairs in ascending order, each pair [a, b] follows:
        - a, b are from arr
        - a < b
        - b - a equals to the minimum absolute difference of any two elements in arr
    """

    arr.sort()
    min_diff = float('inf')

    # Find the minimum absolute difference
    for i in range(len(arr) - 1):
        min_diff = min(min_diff, arr[i+1] - arr[i])

    result = []
    # Collect pairs with the minimum absolute difference
    for i in range(len(arr) - 1):
        if arr[i+1] - arr[i] == min_diff:
            result.append([arr[i], arr[i+1]])

    return result
	```