Find the Highest Altitude Lab
In this lab, you will be working on a problem involving a biker going on a road trip. The road trip consists of n + 1
points at different altitudes. The biker starts his trip on point 0
with an altitude equal to 0
.
You are given an integer array gain
of length n
where gain[i]
is the net gain in altitude between points i
and i + 1
for all (0 <= i < n
). Your task is to return the highest altitude of a point.
Examples
Consider the following examples:
Example 1:
Input: gain = [-5, 1, 5, 0, -7]
Output: 1
Explanation: The altitudes are [0, -5, -4, 1, 1, -6]. The highest is 1.
Example 2:
Input: gain = [-4, -3, -2, -1, 4, 3, 2]
Output: 0
Explanation: The altitudes are [0, -4, -7, -9, -10, -6, -3, -1]. The highest is 0.
Constraints
While working on this problem, keep the following constraints in mind:
n == gain.length
1 <= n <= 100
-100 <= gain[i] <= 100
Requirements
To complete this lab, you need to implement the largestAltitude
function and export it, so it can be properly tested by the provided evaluation script. Make sure to export the function as specified in the challenges:
/** * @param {number[]} gain * @return {number} */ export const largestAltitude = function(gain) { };
Challenges
- Export the
largestAltitude
function from your main file. - Implement the
largestAltitude
function in your main file that takes thegain
integer array and returns the highest altitude.
Good luck, and have fun working on this lab!