Given an array of integers, find all pairs (i, j) such that the absolute difference |arr[i] - arr[j]| is the minimum among all possible pairs in the array.
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.