Day 21: Q2 - Container With Most Water

[Mansi8874]

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.

Example 1:
Input: height = [1,8,6,2,5,4,8,3,7]
Output: 49

Example 2:
Input: height = [1,1]
Output: 1

Constraints:
n == height.length
2 <= n <= 105
0 <= height[i] <= 104

[namita0210]

Please assign this issue to me @bh-g

[Kalpana8055]

@bh-g please assign to me

[Akansha77]

Please assign this issue to me.

[Shubhra-Narang]

Please assign this issue to me

[Tech-neophyte]

Hi! Please assign for solution in python3 @karishma-2020 @bh-g

[sriya-singh]

@bh-g @kratika-Jangid @karishma-2020 please assign this issue to me. I have a better approach in cpp.