Available question text
Determine the maximum time T such that, with unlimited instantaneous swapping of batteries, you can allocate battery minutes to run n computers simultaneously — equivalently find the largest T with sum(min(batteries[i], T)) >= n*T (solved via binary search).
Related questions
Continue with questions that share topics or the same question type.
- Given an array nums and a sliding window of size k moving from the very left to the very right, return the maximum value in the window for each position. Solve in O(n) time using a deque.
Coding
- Reschedule Meetings for Maximum Free Time I
Coding
- Reschedule Meetings for Maximum Free Time II
Coding
- 0/1 Knapsack Problem with Time Complexity Optimization
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 2141. Maximum Running Time of N Computers
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source