✅98.44%🔥3 line code🔥
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution:\n    def repairCars(self, ranks: List[int], cars: int) -> int:\n        \n        arr = range(cars*cars * max(ranks))\n\n        f = lambda t: sum(isqrt(t//r) for r in ranks)\n\n        return  bisect_left(arr,cars, key = lambda t: f(t))\n```
['C', 'Python', 'C++', 'Java', 'Python3', 'C#']