Furthest Building You Can Reach (Heap-based / LeetCode 1642)

Phone ScreenZipLast reported February 2025Medium Frequency

Reported: 4× across candidate reports
First seen: February 2025
Last reported: February 2025
Reported outcome: mixed

Problem Overview

Given a 1D array of building heights, you start at building 0 and want to travel as far right as possible. Moving to a shorter (or equal) building is free. Moving to a taller building requires resources: you have a fixed number of sandbags (each…

3 candidate-reported follow-ups — the exact probes interviewers asked, with the trigger for each
The rest of the problem statement — full requirements, constraints, and edge cases
Approach and trade-offs — what passing candidates did, and the mistakes that sink people

Unlock the full Zip catalog

Full problem statements, candidate-reported follow-ups, and walkthroughs — for every Zip question.

Unlock with Pro

Already a member? Sign in

Verified Source

Every question is reconstructed from multiple independent candidate reports. Verbatim follow-ups, not invented ones.

Codex Fact-Checked

Technical claims, formulas, and scale numbers are reviewed against primary sources.

Interviewer Follow-ups

The exact follow-ups reported by candidates, with the trigger that prompts each one — plus the mistakes that sink people.