Leetcode 2187. Minimum Time to Complete Trips

Given per-bus trip durations, find the minimum time T such that the total trips completed ∑ floor(T / time[i]) across all buses is at least totalTrips. This monotone condition is typically solved by binary searching T over [1, min(time)*totalTrips].