# Teemo Attacking: Explained
Teemo Attacking shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Attack times are sorted; each hit applies duration seconds of poison and a fresh hit refreshes the end time. Add min(duration, next_attack - this_attack) for each gap, plus duration for the last hit.
## 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
Adding duration for every attack even when they overlap.
## 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 here.