Merge pull request #74 from arunsathiya/solve/2366-minimum-replacemen…

…ts-to-sort-the-array

2366. Minimum Replacements To Sort The Array

src/2366-minimum-replacements-to-sort-the-array/main.go

@@ -0,0 +1,16 @@
+package main
+
+func minimumReplacement(nums []int) int64 {
+	count := 0
+	for i := len(nums) - 1; i > 0; i-- {
+		current := nums[i]
+		prev := nums[i-1]
+		if prev <= current {
+			continue
+		}
+		operationsNeeded := (prev + current - 1) / current
+		count += operationsNeeded - 1
+		nums[i-1] = prev / operationsNeeded
+	}
+	return int64(count)
+}

src/2366-minimum-replacements-to-sort-the-array/main_test.go

@@ -0,0 +1,35 @@
+package main
+
+import "testing"
+
+func TestMinimumReplacement(t *testing.T) {
+	tests := []struct {
+		name string
+		nums []int
+		want int64
+	}{
+		{
+			name: "Example 1",
+			nums: []int{3, 9, 3},
+			want: 2,
+		},
+		{
+			name: "Example 2",
+			nums: []int{1, 2, 3, 4, 5},
+			want: 0,
+		},
+		{
+			name: "Example 3",
+			nums: []int{12, 9, 7, 6, 17, 19, 21},
+			want: 6,
+		},
+	}
+
+	for _, tt := range tests {
+		t.Run(tt.name, func(t *testing.T) {
+			if got := minimumReplacement(tt.nums); got != tt.want {
+				t.Errorf("minimumReplacement() = %v, want %v", got, tt.want)
+			}
+		})
+	}
+}