# Last Moment Before All Ants Fall Out Of A Plank: Walkthrough
Last Moment Before All Ants Fall Out Of A Plank shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Ants walk left or right at speed 1; when two collide they each reverse, which is equivalent to them passing through. The last moment is the max of left-going ants' positions and (n - right-going ants' positions).
## 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 every collision (unnecessary and easy to get wrong) or using min instead of max.
## 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 the Linkjob AI app.