Add solution #1268

Author: JoshCrozier

README.md

@@ -403,6 +403,7 @@
 1249|[Minimum Remove to Make Valid Parentheses](./1249-minimum-remove-to-make-valid-parentheses.js)|Medium|
 1252|[Cells with Odd Values in a Matrix](./1252-cells-with-odd-values-in-a-matrix.js)|Easy|
 1267|[Count Servers that Communicate](./1267-count-servers-that-communicate.js)|Medium|
+1268|[Search Suggestions System](./1268-search-suggestions-system.js)|Medium|
 1287|[Element Appearing More Than 25% In Sorted Array](./1287-element-appearing-more-than-25-in-sorted-array.js)|Easy|
 1290|[Convert Binary Number in a Linked List to Integer](./1290-convert-binary-number-in-a-linked-list-to-integer.js)|Easy|
 1291|[Sequential Digits](./1291-sequential-digits.js)|Medium|

solutions/1268-search-suggestions-system.js

@@ -0,0 +1,30 @@
+/**
+ * 1268. Search Suggestions System
+ * https://leetcode.com/problems/search-suggestions-system/
+ * Difficulty: Medium
+ *
+ * You are given an array of strings products and a string searchWord.
+ *
+ * Design a system that suggests at most three product names from products after each
+ * character of searchWord is typed. Suggested products should have common prefix with
+ * searchWord. If there are more than three products with a common prefix return the
+ * three lexicographically minimums products.
+ *
+ * Return a list of lists of the suggested products after each character of searchWord
+ * is typed.
+ */
+
+/**
+ * @param {string[]} products
+ * @param {string} searchWord
+ * @return {string[][]}
+ */
+var suggestedProducts = function(products, searchWord) {
+  products.sort();
+  const result = new Array(searchWord.length);
+  for (let i = 0; i < searchWord.length; i++) {
+    products = products.filter((word) => word[i] === searchWord[i]);
+    result[i] = products.slice(0, 3);
+  }
+  return result;
+};