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.