Merge 6c91626 into 348e922

README.md

@@ -256,3 +256,4 @@ problems from
 * [Day 242](https://github.com/vaskoz/dailycodingproblem-go/issues/498)
 * [Day 243](https://github.com/vaskoz/dailycodingproblem-go/issues/502)
 * [Day 244](https://github.com/vaskoz/dailycodingproblem-go/issues/503)
+* [Day 245](https://github.com/vaskoz/dailycodingproblem-go/issues/506)

day245/problem.go

@@ -0,0 +1,22 @@
+package day245
+
+// MinimumJumps returns the minimum steps to reach the end.
+// Each element contains the max steps that can be taken
+// in a single jump.
+func MinimumJumps(maxSteps []int) int {
+	if len(maxSteps) == 1 {
+		return 0
+	}
+	minJumps := int(^uint(0) >> 1)
+	if maxSteps[0] == 0 { // can't jump from this cell
+		return minJumps
+	}
+	for jump := maxSteps[0]; jump > 0; jump-- {
+		if jump < len(maxSteps) {
+			if result := MinimumJumps(maxSteps[jump:]); result < minJumps {
+				minJumps = result
+			}
+		}
+	}
+	return minJumps + 1
+}

day245/problem_test.go

@@ -0,0 +1,27 @@
+package day245
+
+import "testing"
+
+var testcases = []struct {
+	maxSteps      []int
+	expectedJumps int
+}{
+	{[]int{6, 2, 4, 0, 5, 1, 1, 4, 2, 9}, 2},
+}
+
+func TestMinimumJumps(t *testing.T) {
+	t.Parallel()
+	for _, tc := range testcases {
+		if jumps := MinimumJumps(tc.maxSteps); jumps != tc.expectedJumps {
+			t.Errorf("Expected %v, got %v", tc.expectedJumps, jumps)
+		}
+	}
+}
+
+func BenchmarkMinimumJumps(b *testing.B) {
+	for i := 0; i < b.N; i++ {
+		for _, tc := range testcases {
+			MinimumJumps(tc.maxSteps)
+		}
+	}
+}