✅ 🎯 📌 Simple Solution || Binary Search || Fastest Solution ✅ 🎯 📌
Code
# Code
```python3 []
class Solution:
    def repairCars(self, ranks: List[int], cars: int) -> int:
        def foo(time,cars):
            for rank in ranks:
                cars-=int((time/(rank))**0.5)
            return cars<=0
        l,r=0,max(ranks)*(cars**2)
        while l<r:
            mid=(l+r)//2
            if foo(mid,cars): r=mid
            else: l=mid+1
        return l
```
['Array', 'Binary Search', 'Python3']