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.
Notice that you may not slant the container.
Can this problem be solved like finding the max height that comes for the first time and then finding second max height that came the last time in height array.Why and why not?
This question is not yet answered, be the first one who answer using the comment. Later the confirmed answer will be published as the solution.