solves string matching in an array

Author: anishLearnsToCode

Diff for: README.md

@@ -357,7 +357,7 @@
 | 1394 | [Find Lucky Integer In An Array](https://leetcode.com/problems/find-lucky-integer-in-an-array)                                                       |                                                          [![Java](assets/java.png)](src/FindTheLuckyIntegerInAnArray.java)                                                           |                                                                                                                                   |
 | 1399 | [Count Largest Group](https://leetcode.com/problems/count-largest-group)                                                                             |                                                                [![Java](assets/java.png)](src/CountLargestGroup.java)                                                                |                                                                                                                                   |
 | 1403 | [Minimum Subsequence in Non-Increasing Order](https://leetcode.com/problems/minimum-subsequence-in-non-increasing-order)                             |                                                     [![Java](assets/java.png)](src/MinimumSubSequenceInNonIncreasingOrder.java)                                                      |                                                                                                                                   |
-| 1408 | [String Matching In An Array](https://leetcode.com/problems/string-matching-in-an-array)                                                             |                                                                                                                                                                                      |                                                                                                                                   |
+| 1408 | [String Matching In An Array](https://leetcode.com/problems/string-matching-in-an-array)                                                             |                                                             [![Java](assets/java.png)](src/StringMatchingInAnArray.java)                                                             |                                                                                                                                   |
 | 1413 | [Minimum Value To Get Positive Step By Step Sum](https://leetcode.com/problems/minimum-value-to-get-positive-step-by-step-sum)                       |                                                                                                                                                                                      |                                                                                                                                   |
 | 1417 | [Reformat The String](https://leetcode.com/problems/reformat-the-string)                                                                             |                                                                                                                                                                                      |                                                                                                                                   |
 | 1422 | [Maximum Score After Splitting A String](https://leetcode.com/problems/maximum-score-after-splitting-a-string)                                       |                                                                                                                                                                                      |                                                                                                                                   |

Diff for: src/StringMatchingInAnArray.java

@@ -0,0 +1,24 @@
+import java.util.ArrayList;
+import java.util.List;
+
+public class StringMatchingInAnArray {
+    public List<String> stringMatching(String[] words) {
+        final List<String> result = new ArrayList<>();
+        for (int i = 0 ; i < words.length ; i++) {
+            for (int j = 0 ; j < words.length ; j++) {
+                if(i == j) continue;
+                if (isSubString(words[i], words[j])) {
+                    result.add(words[i]);
+                    break;
+                }
+            }
+        }
+        return result;
+    }
+
+    private boolean isSubString(String pattern, String text) {
+        if (pattern.length() > text.length()) return false;
+        if (pattern.length() == text.length()) return pattern.equals(text);
+        return text.contains(pattern);
+    }
+}