added String Matching in an Array (easy)

Author: minhyeong-joe

Easy/StringMatchingInArray/README.md

@@ -0,0 +1,34 @@
+
+# String Matching in an Array
+[Leetcode Link](https://leetcode.com/problems/string-matching-in-an-array/)
+
+## Problem:
+
+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]`.
+
+## Example:
+
+```
+Input: words = ["mass","as","hero","superhero"]
+Output: ["as","hero"]
+Explanation: "as" is substring of "mass" and "hero" is substring of "superhero".
+["hero","as"] is also a valid answer.
+```
+```
+Input: words = ["leetcode","et","code"]
+Output: ["et","code"]
+Explanation: "et", "code" are substring of "leetcode".
+```
+```
+Input: words = ["blue","green","bu"]
+Output: []
+```
+
+## Note:
+
+- `1 <= words.length <= 100`
+- `1 <= words[i].length <= 30`
+- `words[i]` contains only lowercase English letters.
+- It's guaranteed that `words[i]` will be unique.

Easy/StringMatchingInArray/solution.py

@@ -0,0 +1,30 @@
+from typing import List
+
+def stringMatching(words: List[str]) -> List[str]:
+ substrings = list()
+ words.sort(key=lambda w: len(w))
+ for i in range(len(words)):
+ for j in range(i+1, len(words)):
+ # if words[i] is substring of words[j], insert to substring and exit current loop
+ if words[i] in words[j]:
+ substrings.append(words[i])
+ break
+ return substrings
+
+
+
+# test driver
+words = ["mass","as","hero","superhero"]
+print("Input: words =", words)
+print("Output:", stringMatching(words))
+print()
+
+words = ["leetcode","et","code"]
+print("Input: words =", words)
+print("Output:", stringMatching(words))
+print()
+
+words = ["blue","green","bu"]
+print("Input: words =", words)
+print("Output:", stringMatching(words))
+print()

README.md

@@ -20,6 +20,7 @@ Languages used: Java and Python
  - [Maximize Distance to Closest Person](Easy/MaximizeDistanceToClosestPerson)
  - [Find Common Characters](Easy/FindCommonCharacters)
  - [Third Maximum Number](Easy/ThirdMaximumNumber)
+ - [String Matching in an Array](Easy/StringMatchingInArray)
 - Medium
  - [Minimum Add to Make Parentheses Valid](Medium/MinimumAddtoMakeParenthesesValid)
  - [Distribute Coins in Binary Tree](Medium/DistributionCoinsInBinaryTree)