class Solution:
    def maxArea(self, height: List[int]) -> int:
        """
        How the Algorithm Works:
        Start with two sticks at the ends
        Place one pointer (left) at the first stick and another (right) at the last stick.
        We assume these two sticks form a container that holds some water.
        Calculate how much water they can hold
        The amount of water is based on the shorter stick’s height, multiplied by the distance between the two sticks.
        If the left stick is 5 units tall and the right stick is 8 units tall, and they're 7 positions apart, the water held is:
        5 (shorter stick) * 7 (distance) = 35 units of water
        Move the pointer at the shorter stick
        If the left stick is shorter, move the left pointer to the right (left += 1).
        If the right stick is shorter, move the right pointer to the left (right -= 1).
        Why? Because we want to check if we can get a taller stick that might hold more water.
        Repeat until the two pointers meet
        Each time, check if the new sticks can hold more water than before.
        Keep track of the biggest amount of water found.
        """
        left, right = 0, len(height) - 1
        overall_max = float('-inf')
        
        while left <= right:
            max_value = min(height[left], height[right]) * (right - left)
            overall_max = max(overall_max, max_value)
            if height[right] >= height[left]:
                left += 1
            elif height[right] < height[left]:
                right -= 1
        return overall_max
        """
        create a left and a right index
        repeate while left < right
        - while left + 1 > left
            increment left
        - while right - 1 > right
            decrement right
        - then, given left and right maximuns calculate that maximun, and compare it to the overall maximun. Keep the overall maximum
        - if value at index right > value at index left then increment left
        - if value at index right < value at index left then decrement right

        MAXIMIZING DOES NOT WORK!
        """    
        # left, right = 0, len(height) - 1
        # overall_max = float('-inf')
        
        # while left <= right:
        #     while left + 1 < len(height)-1 and left + 1 < right and height[left + 1] > height[left]:
        #         left += 1
            
        #     while right - 1 > 0 and left < right - 1 and height[right - 1] > height[right]:
        #         right -= 1
            
        #     max_value = min(height[left], height[right]) * (right - left)
        #     overall_max = max(overall_max, max_value)
            
        #     if height[right] >= height[left]:
        #         left += 1
        #     elif height[right] < height[left]:
        #         right -= 1
        
        # return overall_max