Container With Most Water [Python solution required]

[aditya109]

Given n non-negative integers a1, a2, ..., an , where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpoints of the line i is at (i, ai) and (i, 0). Find two lines, which, together with the x-axis forms a container, such that the container contains the most water.

Notice that you may not slant the container.

Example 1:

Input: height = [1,8,6,2,5,4,8,3,7]
Output: 49
Explanation: The above vertical lines are represented by array [1,8,6,2,5,4,8,3,7]. In this case, the max area of water (blue section) the container can contain is 49.
Example 2:

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

Input: height = [4,3,2,1,4]
Output: 16
Example 4:

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

[gopheramit]

@aditya109 i would like to work on this

[aditya109]

Hi @gopheramit ! Happy to receive contribution such early. I have assigned this issue to you.
Before raising a PR, please take a look at CONTRIBUTING.md and follow the guidelines.
Also, if it is not too much to ask, please consider starring the repository. It helps boost the repo popularity and guide more people towards active contribution. That is all. Happy hacking !

[aditya109]

As it has been 8 days and no response from the previous assignee, hence clearing the assignee @gopheramit ! 💔

[pranjalg13]

Hey @aditya109 I am working on this, will shortly raise a PR.
Thanks in advance

[aditya109]

Hi @pranjalg13 ! I have assigned this issue to you.
Before raising a PR, please take a look at CONTRIBUTING.md and follow the guidelines.
Also, if it is not too much to ask, please consider starring ⭐ the repository. It helps boost the repo popularity and guide more people towards active contribution. That is all. Happy hacking !

[pranjalg13]

Hey @aditya109 , please check the PR once. Added all the necessary changes

[aditya109]

This issue was solved by @pranjalg13 , the PR was successfully merged !
Thereby, closing this issue !