# Eliminate Maximum Number Of Monsters: Interview Notes
Eliminate Maximum Number Of Monsters shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Monster i reaches the city at dist[i]/speed[i]; you shoot one per minute starting at t=0. Sort arrival times and greedily shoot in that order; stop at the first monster that arrives at or before the shot minute.
## 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 log n).
## Common mistake
Shooting in input order instead of soonest-arrival first, or using integer division without handling exact-arrival ties.
## 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.