# Cut Off Trees For Golf Event: Explained

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 the trees by height and walk from each to the next with BFS on empty cells; sum the steps, or return -1 if any leg is blocked.

## 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, Dijkstra, Union-Find, or interval 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

Greedy walking toward the next tree without a BFS, which can hit fences.

## 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 Linkjob.