Add solution #1408

Author: JoshCrozier

README.md

@@ -147,6 +147,7 @@
 1374|[Generate a String With Characters That Have Odd Counts](./1374-generate-a-string-with-characters-that-have-odd-counts.js)|Easy|
 1380|[Lucky Numbers in a Matrix](./1380-lucky-numbers-in-a-matrix.js)|Easy|
 1389|[Create Target Array in the Given Order](./1389-create-target-array-in-the-given-order.js)|Easy|
+1408|[String Matching in an Array](./1408-string-matching-in-an-array.js)|Easy|
 1472|[Design Browser History](./1472-design-browser-history.js)|Medium|
 1598|[Crawler Log Folder](./1598-crawler-log-folder.js)|Easy|
 1880|[Check if Word Equals Summation of Two Words](./1880-check-if-word-equals-summation-of-two-words.js)|Easy|

solutions/1408-string-matching-in-an-array.js

@@ -0,0 +1,19 @@
+/**
+ * 1408. String Matching in an Array
+ * https://leetcode.com/problems/string-matching-in-an-array/
+ * Difficulty: Easy
+ *
+ * Given an array of string words. Return all strings in words which is
+ * substring of another word in any order.
+ *
+ * String words[i] is substring of words[j], if can be obtained removing
+ * some characters to left and/or right side of words[j].
+ */
+
+/**
+ * @param {string[]} words
+ * @return {string[]}
+ */
+var stringMatching = function(words) {
+  return words.filter(s => words.some(word => word !== s && word.includes(s)));
+};