Add solution #318

Author: JoshCrozier

README.md

@@ -232,6 +232,7 @@
 303|[Range Sum Query - Immutable](./0303-range-sum-query-immutable.js)|Easy|
 306|[Additive Number](./0306-additive-number.js)|Medium|
 316|[Remove Duplicate Letters](./0316-remove-duplicate-letters.js)|Medium|
+318|[Maximum Product of Word Lengths](./0318-maximum-product-of-word-lengths.js)|Medium|
 322|[Coin Change](./0322-coin-change.js)|Medium|
 326|[Power of Three](./0326-power-of-three.js)|Easy|
 328|[Odd Even Linked List](./0328-odd-even-linked-list.js)|Medium|

solutions/0318-maximum-product-of-word-lengths.js

@@ -0,0 +1,30 @@
+/**
+ * 318. Maximum Product of Word Lengths
+ * https://leetcode.com/problems/maximum-product-of-word-lengths/
+ * Difficulty: Medium
+ *
+ * Given a string array words, return the maximum value of length(word[i]) * length(word[j])
+ * where the two words do not share common letters. If no such two words exist, return 0.
+ */
+
+/**
+ * @param {string[]} words
+ * @return {number}
+ */
+var maxProduct = function(words) {
+  const letters = words.map(word => Array.from(new Set(word)));
+  let result = 0;
+
+  for (let i = 0; i < words.length - 1; i++) {
+    for (let j = i + 1; j < words.length; j++) {
+      if (!letters[i].some(item => letters[j].includes(item))) {
+        const product = words[i].length * words[j].length;
+        if (product > result) {
+          result = product;
+        }
+      }
+    }
+  }
+
+  return result;
+};