added problem 2187

Author: SHA65536

Diff for: problems/problem2187/min_all_trips.go

@@ -0,0 +1,44 @@
+package problem2187
+
+/*
+You are given an array time where time[i] denotes the time taken by the ith bus to complete one trip.
+Each bus can make multiple trips successively; that is, the next trip can start immediately after completing the current trip.
+Also, each bus operates independently; that is, the trips of one bus do not influence the trips of any other bus.
+You are also given an integer totalTrips, which denotes the number of trips all buses should make in total.
+Return the minimum time required for all buses to complete at least totalTrips trips.
+*/
+
+func minimumTime(time []int, totalTrips int) int64 {
+	var left, right int64 = 1, int64(max(time)) * int64(totalTrips) * 10
+	for left < right {
+		mid := left + (right-left)/2
+		if !calcTime(mid, totalTrips, time) {
+			left = mid + 1
+		} else {
+			right = mid
+		}
+	}
+	return left
+}
+
+func calcTime(a int64, total int, times []int) bool {
+	var sum int64
+	totalLong := int64(total)
+	for _, t := range times {
+		sum += a / int64(t)
+		if sum >= totalLong {
+			break
+		}
+	}
+	return sum >= totalLong
+}
+
+func max(in []int) int {
+	var res = in[0]
+	for i := range in {
+		if in[i] > res {
+			res = in[i]
+		}
+	}
+	return res
+}

Diff for: problems/problem2187/min_all_trips_test.go

@@ -0,0 +1,30 @@
+package problem2187
+
+import (
+	"fmt"
+	"testing"
+
+	"github.com/stretchr/testify/assert"
+)
+
+type Result struct {
+	Input    []int
+	Trips    int
+	Expected int64
+}
+
+var Results = []Result{
+	{[]int{1, 2, 3}, 5, 3},
+	{[]int{2}, 1, 2},
+}
+
+func TestMinimumTimeForAllTrips(t *testing.T) {
+	assert := assert.New(t)
+
+	for _, res := range Results {
+		want := res.Expected
+
+		got := minimumTime(res.Input, res.Trips)
+		assert.Equal(want, got, fmt.Sprintf("%+v", res))
+	}
+}

Diff for: readme.md

@@ -397,6 +397,7 @@ Each problem is in it's own directory, with test files. There are helper package
 | 2136 | [Earliest Possible Day of Full Bloom](https://leetcode.com/problems/earliest-possible-day-of-full-bloom) | [My Solution](./problems/problem2136) | ✅ |
 | 2148 | [Count Elements With Strictly Smaller and Greater Elements](https://leetcode.com/problems/count-elements-with-strictly-smaller-and-greater-elements) | [My Solution](./problems/problem2148) | ✅ |
 | 2165 | [Smallest Value of the Rearranged Number](https://leetcode.com/problems/smallest-value-of-the-rearranged-number/) | [My Solution](./problems/problem2165) | ✅ |
+| 2187 | [Minimum Time to Complete Trips](https://leetcode.com/problems/minimum-time-to-complete-trips) | [My Solution](./problems/problem2187) | ✅ |
 | 2225 | [Find Players With Zero or One Losses](https://leetcode.com/problems/find-players-with-zero-or-one-losses/) | [My Solution](./problems/problem2225) | ✅ |
 | 2244 | [Minimum Rounds to Complete All Tasks](https://leetcode.com/problems/minimum-rounds-to-complete-all-tasks) | [My Solution](./problems/problem2244) | ✅ |
 | 2246 | [Longest Path With Different Adjacent Characters](https://leetcode.com/problems/longest-path-with-different-adjacent-characters) | [My Solution](./problems/problem0000) | ✅ |