Merge 31feafd into 69dde06

README.md

@@ -286,3 +286,4 @@ problems from
 * [Day 278](https://github.com/vaskoz/dailycodingproblem-go/issues/565)
 * [Day 279](https://github.com/vaskoz/dailycodingproblem-go/issues/566)
 * [Day 280](https://github.com/vaskoz/dailycodingproblem-go/issues/568)
+* [Day 281](https://github.com/vaskoz/dailycodingproblem-go/issues/572)

day281/problem.go

@@ -0,0 +1,22 @@
+package day281
+
+// FewestBricksCut return the fewest number of
+// bricks that must be cut to create a vertical line.
+func FewestBricksCut(bricks [][]int) int {
+	cumm := make(map[int]int)
+	for _, row := range bricks {
+		last := 0
+		for _, brick := range row {
+			last += brick
+			cumm[last]++
+		}
+		delete(cumm, last)
+	}
+	var most int
+	for _, count := range cumm {
+		if count > most {
+			most = count
+		}
+	}
+	return len(bricks) - most
+}

day281/problem_test.go

@@ -0,0 +1,38 @@
+package day281
+
+import "testing"
+
+// nolint
+var testcases = []struct {
+	bricks [][]int
+	fewest int
+}{
+	{
+		[][]int{
+			{3, 5, 1, 1},
+			{2, 3, 3, 2},
+			{5, 5},
+			{4, 4, 2},
+			{1, 3, 3, 3},
+			{1, 1, 6, 1, 1},
+		},
+		2,
+	},
+}
+
+func TestFewestBricksCut(t *testing.T) {
+	t.Parallel()
+	for _, tc := range testcases {
+		if result := FewestBricksCut(tc.bricks); result != tc.fewest {
+			t.Errorf("Expected %v, got %v", tc.fewest, result)
+		}
+	}
+}
+
+func BenchmarkFewestBricksCut(b *testing.B) {
+	for i := 0; i < b.N; i++ {
+		for _, tc := range testcases {
+			FewestBricksCut(tc.bricks)
+		}
+	}
+}