Container With Most Water [C++ solution required]
Closed this issue · 6 comments
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
@aditya109 , I would like to work on it. Can I be assigned this please?
Hi @Stellar-X ! 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 , I have completed the solution for the problem in C++ and commented the code for easy explanation.
Can you specify where do I store the code in my branch? Like in some specific folder (like 'Programming' or somewhere else.
Also, I have two solutions for the same problem present with me, one is O(n^2) and other is O(n). So, should I add only the most efficient one or both solutions?
Hi @Stellar-X ! Just add the better one !
For info related to contribution, refer to CONTRIBUTING.md.
It has all the steps regarding the above.
@aditya109 , I have created the pull request, so do please check it. Also, please provide the feedback if there is any issue or if something more is needed to be added.
Thank you for the opportunity !!
This issue was solved by @Stellar-X , the PR was successfully merged ! Thereby, closing this issue !