1200. Minimum Absolute Difference - LeetCode Solution

class Solution:
    def minimumAbsDifference(self, arr: List[int]) -> List[List[int]]:
        arr.sort()
        
        pairs = []
        diff = float("inf")
        dict = {}
        
        for i in range(len(arr)-1):
            diff = min(diff, abs(arr[i]  - arr[i+1]))
            if arr[i] in dict:
                dict[arr[i]] +=1
            else:
                dict[arr[i]] = 1
        if arr[-1] in dict:
            dict[arr[-1]] +=1
        else:
            dict[arr[-1]] = 1
        
        for i in range(len(arr)):
            if arr[i] + diff in dict:
                pairs.append([arr[i] , arr[i] + diff])
        return pairs