Documentation Index
Fetch the complete documentation index at: /llms.txt
Use this file to discover all available pages before exploring further.
Tested Python solution for LeetCode 1408 with 22 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 1408 # by problem number
lcpy gen -s string_matching_in_an_array # by problem name
words, return all strings in words that are a substring of another word. You can return the answer in any order.
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: []
Explanation: No string of words is substring of another string.
1 <= words.length <= 1001 <= words[i].length <= 30words[i] contains only lowercase English letters.words are unique.class Solution:
# Time: O(n^2 * m) where n = len(words), m = max word length
# Space: O(1) excluding the output list
def string_matching(self, words: list[str]) -> list[str]:
result: list[str] = []
for i, word in enumerate(words):
for j, other in enumerate(words):
if i != j and word in other:
result.append(word)
break
return result
| Time | Space |
|---|---|
| O(n^2 * m) where n = len(words), m = max word length | O(1) excluding the output list |