Add solution for max altitude

Author: kwnna15

prefix-sum/highest-altitude/README.md

@@ -0,0 +1,33 @@
+# 1732. Find the Highest Altitude
+
+## Description
+See https://leetcode.com/problems/find-the-highest-altitude/description/
+
+## Problem
+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.
+
+## 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
+
+```
+n == gain.length
+1 <= n <= 100
+-100 <= gain[i] <= 100
+```

prefix-sum/highest-altitude/altitude.py

@@ -0,0 +1,6 @@
+def max_altitude(gain: list[int]) -> int:
+    max_alt, curr = 0, 0
+    for i in gain:
+        curr += i
+        max_alt = max(max_alt, curr)
+    return max_alt

prefix-sum/highest-altitude/altitude_test.py

@@ -0,0 +1,26 @@
+from altitude import max_altitude
+
+
+def test_example_1():
+    gain = [-5, 1, 5, 0, -7]
+    assert max_altitude(gain) == 1
+
+
+def test_example_2():
+    gain = [-4, -3, -2, -1, 4, 3, 2]
+    assert max_altitude(gain) == 0
+
+
+def test_example_3():
+    gain = [1, 2, 3, 4, 5]
+    assert max_altitude(gain) == 15
+
+
+def test_example_4():
+    gain = [0, 0, 0, 0, 0]
+    assert max_altitude(gain) == 0
+
+
+def test_example_5():
+    gain = [-1, -2, -3, -4, -5]
+    assert max_altitude(gain) == 0