Easy Solution Using Java
IntuitionApproachComplexity
Time complexity : O(n)

Space complexity : O(1)
Code
# Intuition
<!-- Describe your first thoughts on how to solve this problem. -->

# Approach
<!-- Describe your approach to solving the problem. -->

# Complexity
- Time complexity : O(n)
<!-- Add your time complexity here, e.g. $$O(n)$$ -->

- Space complexity : O(1)
<!-- Add your space complexity here, e.g. $$O(n)$$ -->

# Code
```java []
class Solution {
    public int largestAltitude(int[] gain) {
        int value = 0;
        int max = 0; 

        for(int i = 0; i < gain.length; i++){
            value = value + (gain[i]);
            max = Math.max(value, max);
        }
        return max;
    }
}
```
['Java']