Mar 16

Author: siddydutta

2025-03-March-LeetCoding-Challenge/Minimum Time to Repair Cars.py

@@ -0,0 +1,25 @@
+class Solution:
+    def repairCars(self, ranks: list[int], cars: int) -> int:
+        left, right = 1, cars * cars * ranks[0]
+        while left < right:
+            mid = (left + right) // 2
+            repaired = sum(int((mid / rank) ** 0.5) for rank in ranks)
+            if repaired >= cars:
+                right = mid
+            else:
+                left = mid + 1
+        return left
+
+
+def main():
+    ranks = [4, 2, 3, 1]
+    cars = 10
+    assert Solution().repairCars(ranks, cars) == 16
+
+    ranks = [5, 1, 8]
+    cars = 6
+    assert Solution().repairCars(ranks, cars) == 16
+
+
+if __name__ == '__main__':
+    main()

2025-03-March-LeetCoding-Challenge/README.md

@@ -19,7 +19,7 @@
 | March 13 | [https://leetcode.com/problems/zero-array-transformation-ii/](https://leetcode.com/problems/zero-array-transformation-ii/) | Medium | Unsolved |
 | March 14 | [2226. Maximum Candies Allocated to K Children](https://leetcode.com/problems/maximum-candies-allocated-to-k-children/) | Medium | Solved |
 | March 15 | [2560. House Robber IV](https://leetcode.com/problems/house-robber-iv/) | Medium | Unsolved |
-| March 16 | []() |  |  |
+| March 16 | [2594. Minimum Time to Repair Cars](https://leetcode.com/problems/minimum-time-to-repair-cars/) | Medium | Unsolved |
 | March 17 | []() |  |  |
 | March 18 | []() |  |  |
 | March 19 | []() |  |  |
@@ -41,5 +41,5 @@
 | Level  | Problems | Solved | Unsolved |
 | ---    | --- | --- | --- |
 | Easy   | 5 | 5 | 0 |
-| Medium | 10 | 5 | 5 |
+| Medium | 11 | 5 | 6 |
 | Hard   | 0 | 0 | 0 |