Minimum Time to Repair Cars — LeetCode 2594 Python Solution

The problem

You are given an integer array ranks representing the ranks of some mechanics. ranksi is the rank of the ith mechanic.

Example

Input

ranks = [4,2,3,1], cars = 10

Output

16

Explanation

- The first mechanic will repair two cars. The time required is 4 * 2 * 2 = 16 minutes.

Python solution

class Solution:
    def repairCars(self, ranks: List[int], cars: int) -> int:
        def check(t: int) -> bool:
            return sum(int(sqrt(t // r)) for r in ranks) >= cars

        return bisect_left(range(ranks[0] * cars * cars), True, key=check)

Complexity

Pattern: Monotonic Stack

Answer "what is the next greater element" for every position in one pass. LeetCode 2594. Minimum Time to Repair Cars is filed here because the reference solution below belongs to the algorithm family this hub collects, even though its LeetCode tags point elsewhere.

The monotonic stack guide has the Python template for the pattern and the 225 LeetCode problems that use it.

Related problems