You are given an array of integers time, where time[i] represents the duration required for the $i^{ ext{th}}$ bus to finish a single trip.

Each bus operates independently and can undertake multiple consecutive trips, meaning a new trip starts immediately upon the completion of the previous one.

You are also given an integer totalTrips, which represents the minimum total number of trips that all buses combined must complete.

Return the minimum time required for all buses to complete at least totalTrips trips in total.

Constraints:

• $1 \leq$ time.length $\leq 10^5$

• $1 \leq$ time[i], totalTrips $\leq 10^7$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.