Added Container With Most Water

Author: ignacio-chiazzo

LeetcodeProblems/Algorithms/Container_With_Most_Water.js

@@ -0,0 +1,49 @@
+/*
+Container With Most Water
+https://leetcode.com/problems/container-with-most-water/
+
+You are given an integer array height of length n. There are n vertical lines drawn such that the two endpoints of the ith line are (i, 0) and (i, height[i]).
+
+Find two lines that together with the x-axis form a container, such that the container contains the most water.
+
+Return the maximum amount of water a container can store.
+
+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
+*/
+
+/**
+ * @param {number[]} height
+ * @return {number}
+ */
+ var maxArea = function(height) {
+  let left = 0;
+  let right = height.length - 1;
+  let maxArea = calculateArea(left, right, height);
+  
+  while(left < right) {
+      if(height[left] < height[right]) {
+          left++
+      } else {
+          right--;
+      }
+      maxArea = Math.max(maxArea, calculateArea(left, right, height))   
+  }
+  return maxArea;
+};
+
+var calculateArea = function(x, y, height) {
+  let minHeight = height[x] > height[y] ? height[y] : height[x];
+  let width = y -x;
+  return (width * minHeight);
+}
+
+module.exports.maxArea = maxArea;

LeetcodeProblemsTests/Algorithms/Container_With_Most_Water_Test.js

@@ -0,0 +1,10 @@
+const assert = require('assert');
+const maxArea = require('../../LeetcodeProblems/Algorithms/Container_With_Most_Water_Test').maxArea;
+
+function test() {
+  assert.equal(49, maxArea([1,8,6,2,5,4,8,3,7]));
+  assert.equal(1, maxArea([1,1]));
+  
+}
+
+module.exports.test = test;

README.md

@@ -29,6 +29,7 @@ To run a specific problem in your console run  `node <problem_file_path>` (e.g.
 | [Add Two Numbers ](/LeetcodeProblems/Algorithms/Add_Two_Numbers.js)                                             | Medium | https://leetcode.com/problems/add-two-numbers/  |
 | [Clone Graph ](/LeetcodeProblems/Algorithms/Clone_Graph.js)                                                     | Medium | https://leetcode.com/problems/clone-graph/ |
 | [Coin Change ](/LeetcodeProblems/Algorithms/Coin_Change.js)                                                     | Medium | https://leetcode.com/problems/coin-change/ |
+| [Container With Most Water](/LeetcodeProblems/Algorithms/Container_With_Most_Water.js)                          | Medium | https://leetcode.com/problems/container-with-most-water/ |
 | [Design Circular Deque ](/LeetcodeProblems/Algorithms/Design_Circular_Deque.js)                                 | Medium | https://leetcode.com/problems/design-circular-deque/
 | [Escape The Ghosts](/LeetcodeProblems/Algorithms/Escape_The_Ghosts.js)                                          | Medium | https://leetcode.com/problems/escape-the-ghosts/ |
 | [Find All Anagrams in a String](/LeetcodeProblems/Algorithms/Find_Anagrams.js)                                  | Medium | https://leetcode.com/problems/find-all-anagrams-in-a-string/ |