# Exclusive Time Of Functions: Walkthrough
Exclusive Time Of Functions shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Stack of running function ids plus a prev timestamp: on start, add now-prev to the current top then push; on end, add now-prev+1 and pop. Exclusive time never double-counts callees.
## Steps to say out loud
1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (linked-list rewiring, two pointers, or a monotonic stack) and why a simpler scan fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.
## Complexity
O(n).
## Common mistake
Using inclusive wall time of each function, which includes nested calls.
## 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 https://linkjob.ai.