You are given an integer array heights where heights[i] is the height of building i. You start at building $0$ and want to move to building i + 1 from building i for increasing i.

If heights[i + 1] <= heights[i], you can move to the next building without spending any resources. If heights[i + 1] > heights[i], you must cover the height difference heights[i + 1] - heights[i] by using either:
a number of bricks equal to that difference, or
one of your ladders.

Return the index of the furthest building you can reach.

Constraints:

• $1 \leq$ heights.length $\leq 10^5$

• $1 \leq$ heights[i] $\leq 10^6$

• $0 \leq$ bricks $\leq 10^9$

• $0 \leq$ ladders $\leq$ heights.length

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.