Class Solution
-
- All Implemented Interfaces:
public final class Solution1408 - String Matching in an Array\.
Easy
Given an array of string
words. Return all strings inwordswhich is substring of another word in any order.String
words[i]is substring ofwords[j], if can be obtained removing some characters to left and/or right side ofwords[j].Example 1:
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: []
Constraints:
1 <= words.length <= 1001 <= words[i].length <= 30words[i]contains only lowercase English letters.It's guaranteed that
words[i]will be unique.