🔥 Container With Most Water

Author: maddhruv

README.md

@@ -15,3 +15,4 @@ Solutions of LeetCode Blind 75 Problems in JavaScript
 | [Find Minimum in Rotated Sorted Array](./find-minimum-in-rotated-sorted-array.js) | <img src="https://img.shields.io/badge/-Medium-orange" /> | `Array`, `Binary Search`                           | [:link:](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/) |
 | [Search in Rotated Sorted Array](./search-in-rotated-sorted-array.js)             | <img src="https://img.shields.io/badge/-Medium-orange" /> | `Array`, `Binary Search`                           | [:link:](https://leetcode.com/problems/search-in-rotated-sorted-array/)       |
 | [3Sum](./3sum.js)                                                                 | <img src="https://img.shields.io/badge/-Medium-orange" /> | `Array`, `Two Pointers`, `Sorting`                 | [:link:](https://leetcode.com/problems/3sum/)                                 |
+| [Container With Most Water](./container-with-most-water.js)                       | <img src="https://img.shields.io/badge/-Medium-orange" /> | `Array`, `Two Pointers`, `Greedy`                  | [:link:](https://leetcode.com/problems/container-with-most-water/)            |

container-with-most-water.js

@@ -0,0 +1,17 @@
+const maxArea = (height) => {
+  let resultantArea = 0,
+    low = 0,
+    high = height.length - 1;
+
+  while (low < high) {
+    const smallestHeight = Math.min(height[low], height[high]);
+
+    const area = smallestHeight * (high - low);
+
+    resultantArea = Math.max(resultantArea, area);
+
+    height[low] < height[high] ? low++ : high--;
+  }
+
+  return resultantArea;
+};