1642. Furthest Building You Can Reach

1function furthestBuilding(heights: number[], bricks: number, ladders: number): number {
2    const min_heap = new MinPriorityQueue();
3    for(let i = 0; i < heights.length - 1; i++) {
4	    const diff = heights[i + 1] - heights[i];
5	    if(diff > 0) {
6		    min_heap.enqueue(diff);
7		    
8		    if(min_heap.size() > ladders) {
9			    const bricks_needed = min_heap.dequeue();
10			    bricks -= bricks_needed
11			    
12			    if(bricks < 0) {
13				    return i;
14			    }
15		    }
16	    }
17    }
18    
19    return heights.length - 1;
20};