Q36: Car Fleet. - DSA Patterns (Multi-Lang)

In Simple Words: Sort cars by starting position descending (closest to target first). Compute time to destination (target - pos) / speed. If a car arrives in $\le$ time of car ahead, it joins the fleet ahead.

Time: $O(N \log N)$ | Space: $O(N)$

Multi-Language SolutionsPython 3 • JavaScript • TypeScript • Java • C++

Switch tabs or choose All

def carFleet(target: int, position: list[int], speed: list[int]) -> int:
    cars = sorted(zip(position, speed), reverse=True)
    stack = []
    for p, s in cars:
        time = (target - p) / s
        if not stack or time > stack[-1]:
            stack.append(time)
    return len(stack)