@@ -0,0 +1,1037 @@
+package com.fishercoder.solutions;%0A%0Aimport java.util.List;%0A%0A/**%0A * 1200. Minimum Absolute Difference%0A *%0A * Given an array of distinct integers arr, find all pairs of elements with the minimum absolute difference of any two elements.%0A * Return a list of pairs in ascending order(with respect to pairs), each pair %5Ba, b%5D follows%0A * a, b are from arr%0A * a %3C b%0A * b - a equals to the minimum absolute difference of any two elements in arr%0A *%0A * Example 1:%0A * Input: arr = %5B4,2,1,3%5D%0A * Output: %5B%5B1,2%5D,%5B2,3%5D,%5B3,4%5D%5D%0A * Explanation: The minimum absolute difference is 1. List all pairs with difference equal to 1 in ascending order.%0A *%0A * Example 2:%0A * Input: arr = %5B1,3,6,10,15%5D%0A * Output: %5B%5B1,3%5D%5D%0A *%0A * Example 3:%0A * Input: arr = %5B3,8,-10,23,19,-4,-14,27%5D%0A * Output: %5B%5B-14,-10%5D,%5B19,23%5D,%5B23,27%5D%5D%0A *%0A * Constraints:%0A * 2 %3C= arr.length %3C= 10%5E5%0A * -10%5E6 %3C= arr%5Bi%5D %3C= 10%5E6%0A * */%0Apublic class _1200 %7B%0A    public static class Solution1 %7B%0A        public List%3CList%3CInteger%3E%3E minimumAbsDifference(int%5B%5D arr) %7B%0A            return null;%0A        %7D%0A    %7D%0A%7D%0A

add skeleton for 1200