Container With Most Water Solution added (#36)

Co-authored-by: Gourav Rusiya <[email protected]>

Author: KevinChittilapilly

Python/container_with_most_water.py

@@ -0,0 +1,23 @@
+class Solution(object):
+    def maxArea(self, height):
+        """
+        :type height: List[int]
+        :rtype: int
+        """
+        
+        #print(height)
+        start=0
+        end=len(height)-1
+        max_area=0
+        curr_area=0
+        while(start!=end):
+            if(height[start]<height[end]):
+                curr_area=height[start]*(end-start)
+                start+=1
+            else:
+                curr_area=height[end]*(end-start)
+                end-=1
+            if(curr_area>max_area):
+                max_area=curr_area
+            print(curr_area)
+        return max_area

README.md

@@ -93,6 +93,7 @@ Check out ---> [Sample PR](https://github.com/codedecks-in/LeetCode-Solutions/pu
 | 119  | [Pascal's Triangle II](https://leetcode.com/problems/pascals-triangle-ii)       | [Python](./Python/pascals-triangle-ii.py)        | _O(N^2)_ | _O(K)_ | Easy     |  |      |
 | 1480  | [Running Sum of 1d Array](https://leetcode.com/problems/running-sum-of-1d-array/)       | [Java](./Java/running-sum-of-1d-array.java)        | _O(N)_ | _O(N)_ | Easy     | Simple sum |      |
 | 42  | [Trapping Rain Water](https://leetcode.com/problems/trapping-rain-water/)       | [Python](./Python/trapping_rain.py)        | _O(N^2)_ | _O(N)_ | Hard     | Array |      |
+| 11  | [Container with Most Water](https://leetcode.com/problems/container-with-most-water/)       | [Python](./Python/container_with_most_water.py)        | _O(N)_ | _O(N)_ | Medium     | Array Two Pointers|      |
 
 
 <br/>