#binary-search-algorithm

Articles tagged with #binary-search-algorithm

2616. Minimize the Maximum Difference of Pairs
class Solution: def minimizeMax(self, nums: List[int], p: int) -> int: l = len(nums) def canMakePairs(maxDiff): count = 0 i = 1 while i < len(nums): if nums[i] - nums[i - 1] <= ...
Jun 14, 20251 min read1
2594. Minimum Time to Repair Cars
class Solution: def carsRepariedInFixedTime(self, time, ranks): s = 0 for e in ranks: x = math.sqrt(time / e) s += math.floor(x) return s def repairCars(self, ranks: List[int], cars: int) -> ...
Mar 16, 20251 min read