# Car Pooling: Walkthrough
Car Pooling shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Sweep pickup and drop-off events sorted by location (drop-offs before pickups at the same mile). A min-heap of active trips also works: subtract passengers when their end is due, then add the new load and fail if it exceeds capacity.
## Steps to say out loud
1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (a heap or priority queue, Union-Find, interval scheduling, bitmask DP, a topological order, or a Trie) 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 log n).
## Common mistake
Adding every trip's passengers into a global total without subtracting drop-offs along the route.
## 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 Linkjob AI.