11. Container With Most Water

container-with-most-water.go

// https://leetcode.com/problems/container-with-most-water/
// 
// Time: O(n)
// Space: O(1)
//
// n = number of elements in array

// .................... //

func maxArea(height []int) int {
    n := len(height)
    area := 0

    l, r := 0, n - 1
    for l < r {
        calc := (r-l) * min(height[l], height[r])
        area = max(area, calc)

        if height[l] >= height[r] {
            r--
        } else {
            l++
        }
    }

    return area
}