solves container with most water

Author: anishLearnsToCode

README.md

@@ -19,6 +19,7 @@
 |  7   | [Reverse Integer](https://leetcode.com/problems/reverse-integer/)                                                                                         |                                    [![Java](assets/java.png)](src/ReverseInteger.java) [![Python](assets/python.png)](python/reverse_integer.py)                                     | [![java-yt](assets/java-yt.png)](https://youtu.be/7bOhyl5lWjI) [![python-yt](assets/python-yt.png)](https://youtu.be/lmLG30TLcSg) |
 |  8   | [String to Integer (atoi)](https://leetcode.com/problems/string-to-integer-atoi)                                                                          |                                                               [![Java](assets/java.png)](src/StringToIntegerAtoi.java)                                                               |                                                                                                                                   |
 |  9   | [PalindromeNumber](https://leetcode.com/problems/palindrome-number/)                                                                                      |                                  [![Java](assets/java.png)](src/PalindromeNumber.java) [![Python](assets/python.png)](python/palindrome_number.py)                                   |                                                                                                                                   |
+|  11  | [Container With Most Water](https://leetcode.com/problems/container-with-most-water)                                                                      |                                                              [![Java](assets/java.png)](src/ContainerWitMostWater.java)                                                              |                                                                                                                                   |
 |  13  | [Roman To Integer](https://leetcode.com/problems/roman-to-integer/)                                                                                       |                                    [![Java](assets/java.png)](src/RomanToInteger.java) [![Python](assets/python.png)](python/roman_to_integer.py)                                    | [![java-yt](assets/java-yt.png)](https://youtu.be/BCue_mO_81A) [![python-yt](assets/python-yt.png)](https://youtu.be/8h_yGTNvKMA) |
 |  14  | [Longest Common Prefix](https://leetcode.com/problems/longest-common-prefix/)                                                                             |                               [![Java](assets/java.png)](src/LongestCommonPrefix.java) [![Python](assets/python.png)](python/longest_common_prefix.py)                               |                                                                                                                                   |
 |  20  | [ValidParentheses](https://leetcode.com/problems/valid-parentheses/)                                                                                      |                                  [![Java](assets/java.png)](src/ValidParentheses.java) [![Python](assets/python.png)](python/valid_parentheses.py)                                   |                                                                                                                                   |

src/ContainerWitMostWater.java

@@ -0,0 +1,15 @@
+// https://leetcode.com/problems/container-with-most-water
+// T: O(n)
+// S: O(1)
+
+public class ContainerWitMostWater {
+    public static int maxArea(int[] height) {
+        int water = 0;
+        for (int i = 0, j = height.length - 1; i < j; ) {
+            water = Math.max(water, Math.min(height[i], height[j]) * (j - i));
+            if (height[i] > height[j]) j--;
+            else i++;
+        }
+        return water;
+    }
+}