added problem 2305

Author: SHA65536

problems/problem2305/fair_cookies.go

@@ -0,0 +1,55 @@
+package problem2305
+
+import "math"
+
+/*
+You are given an integer array cookies, where cookies[i] denotes the number of cookies in the ith bag.
+You are also given an integer k that denotes the number of children to distribute all the bags of cookies to.
+All the cookies in the same bag must go to the same child and cannot be split up.
+The unfairness of a distribution is defined as the maximum total cookies obtained by a single child in the distribution.
+Return the minimum unfairness of all distributions.
+*/
+
+func distributeCookies(cookies []int, k int) int {
+	return calcMinUnfairness(cookies, make([]int, k))
+}
+
+// calcMinUnfairness calculates the minimum unfairness with
+// cookies as cookie bags, dist as the number of cookies each child got
+func calcMinUnfairness(cookies, dist []int) int {
+	if len(cookies) == 0 {
+		// If we ran out of cookies, find the unfairness value
+		res := 0
+		// Unfairness the the max cookies a child got
+		for _, v := range dist {
+			res = max(res, v)
+		}
+		return res
+	}
+	// If we still have cookies to give
+	var res = math.MaxInt
+	// Try giving the first bag to each child
+	for i := range dist {
+		// Give cookies
+		dist[i] += cookies[0]
+		// Calculate unfairness after giving the cookies
+		res = min(res, calcMinUnfairness(cookies[1:], dist))
+		// Take back the cookies to not interfere with the next calc
+		dist[i] -= cookies[0]
+	}
+	return res
+}
+
+func max(a, b int) int {
+	if a > b {
+		return a
+	}
+	return b
+}
+
+func min(a, b int) int {
+	if a < b {
+		return a
+	}
+	return b
+}

problems/problem2305/fair_cookies_test.go

@@ -0,0 +1,37 @@
+package problem2305
+
+import (
+	"fmt"
+	"testing"
+
+	"github.com/stretchr/testify/assert"
+)
+
+type TestCase struct {
+	Input    []int
+	K        int
+	Expected int
+}
+
+var TestCases = []TestCase{
+	{[]int{8, 15, 10, 20, 8}, 2, 31},
+	{[]int{6, 1, 3, 2, 2, 4, 1, 2}, 3, 7},
+}
+
+func TestFairCookieDistribution(t *testing.T) {
+	assert := assert.New(t)
+
+	for _, tc := range TestCases {
+		want := tc.Expected
+		got := distributeCookies(tc.Input, tc.K)
+		assert.Equal(want, got, fmt.Sprintf("%+v", tc))
+	}
+}
+
+func BenchmarkFairCookieDistribution(b *testing.B) {
+	for i := 0; i < b.N; i++ {
+		for _, tc := range TestCases {
+			distributeCookies(tc.Input, tc.K)
+		}
+	}
+}

readme.md

@@ -505,6 +505,7 @@ Each problem is in it's own directory, with test files. There are helper package
 | 2279 | [Maximum Bags With Full Capacity of Rocks](https://leetcode.com/problems/maximum-bags-with-full-capacity-of-rocks) | [My Solution](./problems/problem2279) | ✅ |
 | 2284 | [Sender With Largest Word Count](https://leetcode.com/problems/sender-with-largest-word-count) | [My Solution](./problems/problem2284) | ✅ |
 | 2300 | [Successful Pairs of Spells and Potions](https://leetcode.com/problems/successful-pairs-of-spells-and-potions) | [My Solution](./problems/problem2300) | ✅ |
+| 2305 | [Fair Distribution of Cookies](https://leetcode.com/problems/fair-distribution-of-cookies) | [My Solution](./problems/problem2305) | ✅ |
 | 2306 | [Naming a Company](https://leetcode.com/problems/naming-a-company) | [My Solution](./problems/problem2306) | ✅ |
 | 2316 | [Count Unreachable Pairs of Nodes in an Undirected Graph](https://leetcode.com/problems/count-unreachable-pairs-of-nodes-in-an-undirected-graph) | [My Solution](./problems/problem2316) | ✅ |
 | 2326 | [Spiral Matrix IV](https://leetcode.com/problems/spiral-matrix-iv) | [My Solution](./problems/problem2326) | ✅ |