Container with most water | Leetcode 11
Container With Most Water - LeetCode
You are given an integer array height of length n. There are n vertical lines drawn such that the two endpoints of the…
What is the best possiblity for a container to have maximum water?
The best possiblity will be when, you have the widest width(w) and highest height(h), right?
So the maximum width we can have is length of the array(n). Now we have to find the height. We can do that using two pointers(left and right).
left => left most element of the array.
right => right most element of the array.
we will compare both the elements, and whichever is smaller, we will move that pointer since we want to find the best height for the container. While doing so we keep calculating the current area and updating the ans.
Here is the code.