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.

Example 2:

Input: words = ["leetcode","et","code"]
Output: ["et","code"]
Explanation: "et", "code" are substring of "leetcode".

Example 3:

Input: words = ["blue","green","bu"]
Output: []
Explanation: No string of words is substring of another string.

Constraints:

1 <= words.length <= 100
1 <= words[i].length <= 30
words[i] contains only lowercase English letters.
All the strings of words are unique.

22:T558,# Approach\n 1. Initialize an empty list `ans` to store the **result**.\n 2. Iterate through the `words` list using a for loop along with their indices.\n 3. For each word, concatenate all other words in the list (except the current word) into a single string `other_words`.\n 4. Check if the current word is a substring of the `other_words` using the `in` operator.\n 5. If it is a substring, append the current word to the `ans` list.\n 6. Continue this process for all words in the list.\n 7. Return the `ans` list as the final result containing words that are substrings of other words in the list.\n\n\n# Code\n```\nclass Solution:\n def stringMatching(self, words: List[str]) -> List[str]:\n ans = [] # we gonna store the results here\n\n for i, x in enumerate(words):\n # Join all words before and after the current word into a single string\n other_words = " ".join(words[:i] + words[i + 1:])\n # Example: words = ["mass","as","hero","superhero"

String Matching in an Array

Problem Description

Problem Description

Answer Panel