# Kill Process: Interview Notes
Kill Process shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Build a parent→children map and BFS/DFS from the kill pid, collecting every descendant (including itself).
## Steps to say out loud
1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (tree DFS, BST walk, or subtree DP) 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
Removing only the pid and leaving its children alive.
## 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 undetectable AI interview copilot.