Merge 447929d into ee3216b

README.md

@@ -191,3 +191,4 @@ problems from
 * [Day 178](https://github.com/vaskoz/dailycodingproblem-go/issues/367)
 * [Day 179](https://github.com/vaskoz/dailycodingproblem-go/issues/371)
 * [Day 180](https://github.com/vaskoz/dailycodingproblem-go/issues/373)
+* [Day 184](https://github.com/vaskoz/dailycodingproblem-go/issues/378)

day184/problem.go

@@ -0,0 +1,21 @@
+package day184
+
+// GcdSlice returns the greatest common denominator
+// of all the values in the slice.
+func GcdSlice(nums []int) int {
+	if len(nums) == 0 {
+		return 0
+	}
+	result := nums[0]
+	for i := 1; i < len(nums); i++ {
+		result = gcd(nums[i], result)
+	}
+	return result
+}
+
+func gcd(a, b int) int {
+	if a == 0 {
+		return b
+	}
+	return gcd(b%a, a)
+}

day184/problem_test.go

@@ -0,0 +1,30 @@
+package day184
+
+import "testing"
+
+var testcases = []struct {
+	nums     []int
+	expected int
+}{
+	{[]int{42, 56, 14}, 14},
+	{[]int{14}, 14},
+	{nil, 0},
+	{[]int{}, 0},
+}
+
+func TestGcdSlice(t *testing.T) {
+	t.Parallel()
+	for _, tc := range testcases {
+		if result := GcdSlice(tc.nums); result != tc.expected {
+			t.Errorf("Expected %v, got %v for input %v", tc.expected, result, tc.nums)
+		}
+	}
+}
+
+func BenchmarkGcdSlice(b *testing.B) {
+	for i := 0; i < b.N; i++ {
+		for _, tc := range testcases {
+			GcdSlice(tc.nums)
+		}
+	}
+}