# Furthest Building You Can Reach: Explained

Furthest Building You Can Reach shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

For each upward climb, push the height diff onto a min-heap of "ladder uses". When the heap grows past the ladder count, pay bricks for the smallest climb you had treated as a ladder. Stop when bricks go negative.

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (a heap or priority queue, Union-Find, interval scheduling, bitmask DP, a topological order, or a Trie) and why a nested scan or naive search fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.

## Complexity

O(n log n).

## Common mistake

Using ladders on the earliest climbs instead of saving them for the largest diffs.

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