1524. String Matching in an Array
My accepted Python solution to LeetCode problem 1524, String Matching in an Array, running in 3ms.
- Difficulty: Easy
- Python
- Runtime 3ms
- Memory 17.2MB
- Updated
Read the problem on LeetCode View on GitHub
The problem statement is LeetCode’s and stays on their site. What follows is my accepted solution.
Python
Accepted on LeetCode — runtime 3ms, memory 17.2MB, accepted 2025-12-29.
class Solution:
def stringMatching(self, words: List[str]) -> List[str]:
result = []
for word in words:
for other in words:
if word != other and word in other:
result.append(word)
break
return result