Class Solution

  • All Implemented Interfaces:

    
    public final class Solution
    
                        

    1408 - String Matching in an Array.

    Easy

    Given an array of string words. Return all strings in words which is substring of another word in any order.

    String words[i] is substring of words[j], if can be obtained removing some characters to left and/or right side of words[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 <= 100

    • 1 <= words[i].length <= 30

    • words[i] contains only lowercase English letters.

    • It's guaranteed that words[i] will be unique.

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description
    • Field Summary

      Fields 
      Modifier and Type Field Description
    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()
    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description
    • Method Summary

      Modifier and Type Method Description
      final List<String> stringMatching(Array<String> words)
      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait