add new solutions

solutions/12/q1200/solution.go

@@ -0,0 +1,29 @@
+package q1200
+
+import (
+	"math"
+	"slices"
+)
+
+func minimumAbsDifference(arr []int) [][]int {
+	slices.Sort(arr)
+
+	minDist := math.MaxInt
+	for i := range len(arr) - 1 {
+		minDist = min(minDist, arr[i+1]-arr[i])
+	}
+
+	ret := [][]int{}
+	for i := range len(arr) - 1 {
+		if arr[i+1]-arr[i] == minDist {
+			nums := []int{arr[i+1], arr[i]}
+			if nums[0] > nums[1] {
+				nums[0], nums[1] = nums[1], nums[0]
+			}
+			ret = append(ret, nums)
+		}
+	}
+	return ret
+}
+
+var _ = minimumAbsDifference