problem: 1732. Find the Highest Altitude

Author: flynnpark

solutions/solution_1732/README.md

@@ -0,0 +1,27 @@
+# 1732. [Find the Highest Altitude](https://leetcode.com/problems/find-the-highest-altitude/?envType=study-plan-v2&id=leetcode-75)
+
+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:**
+
+<pre>
+<strong>Input:</strong> gain = [-5,1,5,0,-7]
+<strong>Output:</strong> 1
+<strong>Explanation:</strong> The altitudes are [0,-5,-4,1,1,-6]. The highest is 1.
+</pre>
+
+### **Example 2:**
+
+<pre>
+<strong>Input:</strong> gain = [-4,-3,-2,-1,4,3,2]
+<strong>Output:</strong> 0
+<strong>Explanation:</strong> The altitudes are [0,-4,-7,-9,-10,-6,-3,-1]. The highest is 0.
+</pre>
+
+### **Constraints:**
+
+- `n == gain.length`
+- `1 <= n <= 100`
+- `-100 <= gain[i] <= 100`

solutions/solution_1732/__init__.py

@@ -0,0 +1,6 @@
+from typing import List
+
+
+class Solution:
+    def largestAltitude(self, gain: List[int]) -> int:
+        ...

solutions/solution_1732/test_solution.py

@@ -0,0 +1,39 @@
+from typing import TypedDict
+
+import pytest
+
+from . import Solution
+
+
+class InputDict(TypedDict):
+    gain: list[int]
+
+
+class CaseDict(TypedDict):
+    input: InputDict
+    expected: int
+
+
+test_cases: list[CaseDict] = [
+    {
+        'input': {
+            'gain': [-5, 1, 5, 0, -7],
+        },
+        'expected': 1,
+    },
+    {
+        'input': {
+            'gain': [-4, -3, -2, -1, 4, 3, 2],
+        },
+        'expected': 0,
+    },
+]
+
+
+@pytest.mark.parametrize(
+    'test_case',
+    test_cases,
+)
+def test_solution(test_case: CaseDict):
+    result = Solution().largestAltitude(**test_case['input'])
+    assert result == test_case['expected']