# Car Fleet II: Interview Notes
Car Fleet II shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Cars go to the right; a faster car catches a slower one ahead and they become a fleet at the collision time (then follow the slower speed). A monotonic stack of (position, speed, collision_time_with_next) scanned from the right computes when each car hits the fleet in front, or infinity.
## Steps to say out loud
1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (binary search on the answer, monotonic stack or deque, interval / interval-DP, string hashing, graph traversal, or shortest paths) and why a nested scan or naive search fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.
## Complexity
O(n).
## Common mistake
Simulating pairwise collisions in time order (O(n^2)) or using Car Fleet I’s “reaches target” rule, which is a different question.
## Practice tip
Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at AI interview assistant.