You are given an integer array height of length n. There are n vertical lines drawn such that the two endpoints of the ith line are (i, 0) and (i, height[i]).
Find two lines that together with the x-axis form a container, such that the container contains the most water.
Return the maximum amount of water a container can store.
How do I solve it
Breakdown:
Go through the array, saving the area of the highest area (widht * smallest height of index).
To iterate through, compare the heights of each index, the smallest height gets brought closer to the other (+/-)
What is this problem
How do I solve it
Breakdown: