String Matching in an Array — LeetCode 1408 Python Solution

The problem

Given an array of string words, return all strings in words that are a substring of another word. You can return the answer in any order.

Example

Input

words = ["mass","as","hero","superhero"]

Output

["as","hero"]

Explanation

"as" is substring of "mass" and "hero" is substring of "superhero".

Python solution

class Solution:
    def stringMatching(self, words: List[str]) -> List[str]:
        ans = []
        for i, s in enumerate(words):
            if any(i != j and s in t for j, t in enumerate(words)):
                ans.append(s)
        return ans

Complexity

Pattern: Hash Map

Trade memory for time: remember what you have seen so the second pass never happens. LeetCode 1408. String Matching in an Array is filed here because the reference solution below belongs to the algorithm family this hub collects, even though its LeetCode tags point elsewhere.

The hash map guide has the Python template for the pattern and the 709 LeetCode problems that use it.

Related problems