add new solutions

solutions/30/q3005/solution.go

@@ -0,0 +1,27 @@
+package q3005
+
+import "slices"
+
+func maxFrequencyElements(nums []int) int {
+	slices.Sort(nums)
+	maxFreq := 0
+	nMaxFreq := 0
+
+	freq := 1
+	for i := 1; i <= len(nums); i++ {
+		if i < len(nums) && nums[i] == nums[i-1] {
+			freq++
+		} else {
+			if freq > maxFreq {
+				maxFreq = freq
+				nMaxFreq = 1
+			} else if freq == maxFreq {
+				nMaxFreq++
+			}
+			freq = 1
+		}
+	}
+	return maxFreq * nMaxFreq
+}
+
+var _ = maxFrequencyElements

solutions/30/q3074/solution.go

@@ -0,0 +1,21 @@
+package q3074
+
+import "slices"
+
+func minimumBoxes(apple []int, capacity []int) int {
+	apples := 0
+	for _, a := range apple {
+		apples += a
+	}
+
+	slices.Sort(capacity)
+	for i := len(capacity) - 1; i >= 0; i-- {
+		apples -= capacity[i]
+		if apples <= 0 {
+			return len(capacity) - i
+		}
+	}
+	return len(capacity)
+}
+
+var _ = minimumBoxes