Add solution #599

Author: JoshCrozier

README.md

@@ -123,6 +123,7 @@
 565|[Array Nesting](./0565-array-nesting.js)|Medium|
 566|[Reshape the Matrix](./0566-reshape-the-matrix.js)|Easy|
 567|[Permutation in String](./0567-permutation-in-string.js)|Medium|
+599|[Minimum Index Sum of Two Lists](./0599-minimum-index-sum-of-two-lists.js)|Easy|
 606|[Construct String from Binary Tree](./0606-construct-string-from-binary-tree.js)|Easy|
 617|[Merge Two Binary Trees](./0617-merge-two-binary-trees.js)|Easy|
 628|[Maximum Product of Three Numbers](./0628-maximum-product-of-three-numbers.js)|Easy|

solutions/0599-minimum-index-sum-of-two-lists.js

@@ -0,0 +1,28 @@
+/**
+ * 599. Minimum Index Sum of Two Lists
+ * https://leetcode.com/problems/minimum-index-sum-of-two-lists/
+ * Difficulty: Easy
+ *
+ * Suppose Andy and Doris want to choose a restaurant for dinner, and they both have a list
+ * of favorite restaurants represented by strings.
+ *
+ * You need to help them find out their common interest with the least list index sum.
+ * If there is a choice tie between answers, output all of them with no order requirement.
+ * You could assume there always exists an answer.
+ */
+
+/**
+ * @param {string[]} list1
+ * @param {string[]} list2
+ * @return {string[]}
+ */
+var findRestaurant = function(list1, list2) {
+  const map = new Map(list1.map((str, index) => [str, index]));
+
+  return list2
+    .map((str, index) => map.has(str) ? [map.get(str) + index, str] : null)
+    .filter(Boolean)
+    .sort(([a], [b]) => a - b)
+    .filter(([sum], index, [[lowest]]) => sum === lowest)
+    .map(([, str]) => str);
+};