# Woodcutting For At Least M Metres: Interview Notes
Woodcutting For At Least M Metres shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Binary search the saw height; wood collected is the sum of max(0, tree-height).
## 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 answer, sliding window, stack, or in-place rewrite) 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 log max(tree)).
## Common mistake
Including trees shorter than the saw height as negative wood.
## 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.