You are given an integer array gain where gain[i] represents the net change in altitude after traveling from point i to point i + 1. The altitude at the starting point is $0$.

Compute and return the highest altitude reached at any point during the trip, including the starting point.

Constraints:

• n == gain.length

• $1 \leq `n` \leq 100$

• $-100 \leq `gain[i]` \leq 100$

Input: gain = [3, -2, 4, -1]-List[int]
Output: 5-int
Explanation: Starting at altitude 0, the altitudes along the way are 0 → 3 → 1 → 5 → 4, so the highest altitude reached is 5.

Input: gain = [-2, -3, -4]-List[int]
Output: 0-int
Explanation: The altitudes are 0 → -2 → -5 → -9, so the starting altitude 0 is the highest.

Input: gain = [0, 0, 0, 0, 0]-List[int]
Output: 0-int
Explanation: The altitude remains 0 throughout the trip, so the highest altitude is 0.

Input: gain = [10, -20, 15, -5, 7, -3]-List[int]
Output: 10-int
Explanation: The altitudes are 0 → 10 → -10 → 5 → 0 → 7 → 4, so the maximum altitude reached is 10.

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.