Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 1642. Furthest Building You Can Reach
Given an array of building heights and limited bricks and ladders, find the furthest building index you can reach from 0 by covering each positive height jump either with bricks equal to the difference or by using a ladder. The core challenge is optimally allocating scarce ladders/bricks—typically by greedily assigning ladders to the largest climbs—to maximize how far you can go.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.