# Cut Off Trees For Golf Event: Practice Notes

Cut Off Trees For Golf Event shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Sort trees by height and BFS the distance between consecutive trees, summing them; blocked if any BFS fails.

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (graph BFS/DFS, union-find, topological sort, or tree 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(t * mn).

## Common mistake

Walking in sorted order without recomputing a walkable path (you cannot jump).

## 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 helper that uses your resume.