-
Notifications
You must be signed in to change notification settings - Fork 249
Container With Most Water [C solution required] #398
Comments
Hello, can you please assign this issue to me? |
Hi @iamanshulgit ! Happy to receive contribution such early. I have assigned this issue to you. |
Hi @aditya109 I have uploaded the task. Please merge my PR. Thank you |
Hi @iamanshulgit ! Please raise a fresh PR ! Your PR seems to be closed. #441 |
As it has been 8 days and no response from the previous assignee, hence clearing the assignee @iamanshulgit ! 💔 |
@aditya109 Hi, can I work on this issue? Please |
Hi @aditya109 ! Sure thing. I have assigned this issue to you. |
#555 Please check my PR. |
Hi @harshitcodes1 ! #555 (review) Please check my comment on your PR. |
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
The text was updated successfully, but these errors were encountered: