# Car Fleet Arrival Times (Practice 5063): Review

Interviewers use this pattern to test whether you can state the invariant before coding. Here is a compact rehearsal note.

## Approach

Sort cars by position descending and keep a stack of arrival times; a slower car ahead absorbs faster ones.

```python
def car_fleet(target,pos,speed):
st=[]
for p,s in sorted(zip(pos,speed),reverse=True):
t=(target-p)/s
if not st or t>st[-1]: st.append(t)
return len(st)
```

## Complexity

Linear in the dominant input size for the scan; heap/tree variants add a log factor.

## Interview pitfalls

State the invariant out loud, name the complexity, then code. Skipping the invariant is the usual fail mode.

## Practicing out loud

Narrate the approach, complexity and one edge case in under a minute. Disclosure: I work on Linkjob AI, a real-time interview assistant. If you want live practice help, see Linkjob.ai.