[REFACTOR] [Hacker Rank] Interview Preparation Kit: Greedy Algorithms: Minimum Absolute Difference in an Array. Test Case 2 fixed.

Author: Gonzalo Diaz

exercises/hackerrank/interview_preparation_kit/greedy_algorithms/minimum_absolute_difference_in_an_array.go

@@ -5,21 +5,35 @@
 
 package hackerrank
 
-import "slices"
+import (
+	"slices"
+)
 
 func minimumAbsoluteDifference(arr []int32) int32 {
 	// Sort the array
-	arrCopy := make([]int32, len(arr))
+	sorted_nums := make([]int32, len(arr))
 
-	copy(arrCopy, arr)
-	slices.Sort(arrCopy)
+	copy(sorted_nums, arr)
+	slices.Sort(sorted_nums)
 
 	// Find the minimum absolute difference
 	result := int32(0)
-	for i := range len(arrCopy) - 1 {
-		diff := arrCopy[i+1] - arrCopy[i]
-		if diff < result || result == 0 {
+	var resultEmpty = true
+
+	for i := range len(sorted_nums) - 1 {
+		var a_value = sorted_nums[i]
+		var b_value = sorted_nums[i+1]
+
+		diff := a_value - b_value
+		if diff < 0 {
+			diff = -1 * diff
+		}
+
+		if resultEmpty {
 			result = diff
+			resultEmpty = false
+		} else {
+			result = min(result, diff)
 		}
 	}
 	return result