Add solution #1732

Author: JoshCrozier

README.md

@@ -357,6 +357,7 @@
 1672|[Richest Customer Wealth](./1672-richest-customer-wealth.js)|Easy|
 1679|[Max Number of K-Sum Pairs](./1679-max-number-of-k-sum-pairs.js)|Medium|
 1716|[Calculate Money in Leetcode Bank](./1716-calculate-money-in-leetcode-bank.js)|Easy|
+1732|[Find the Highest Altitude](./1732-find-the-highest-altitude.js)|Easy|
 1748|[Sum of Unique Elements](./1748-sum-of-unique-elements.js)|Easy|
 1768|[Merge Strings Alternately](./1768-merge-strings-alternately.js)|Easy|
 1780|[Check if Number is a Sum of Powers of Three](./1780-check-if-number-is-a-sum-of-powers-of-three.js)|Medium|

solutions/1732-find-the-highest-altitude.js

@@ -0,0 +1,19 @@
+/**
+ * 1732. Find the Highest Altitude
+ * https://leetcode.com/problems/find-the-highest-altitude/
+ * Difficulty: Easy
+ *
+ * There is 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 altitude equal 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). Return the highest altitude of a point.
+ */
+
+/**
+ * @param {number[]} gain
+ * @return {number}
+ */
+var largestAltitude = function(gain) {
+  return Math.max(...gain.reduce((all, n, i) => all.push(all[i] - n * -1) && all, [0]));
+};