'''
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: []
'''
def StringMatching(words):
    word = sorted(words, key = len)
    output = []

    for i in range(len(word)):
        for j in range(i+1, len(word)):
            if word[i] in word[j]:
                output.append(word[i])
                break
    
    return output

print(StringMatching(["leetcode","et","code"]))
b27d4e0234659fc071a29eeb245139d2809b6a25
<mask token>

<mask token>


def StringMatching(words):
    word = sorted(words, key=len)
    output = []
    for i in range(len(word)):
        for j in range(i + 1, len(word)):
            if word[i] in word[j]:
                output.append(word[i])
                break
    return output


<mask token>

<mask token>


def StringMatching(words):
    word = sorted(words, key=len)
    output = []
    for i in range(len(word)):
        for j in range(i + 1, len(word)):
            if word[i] in word[j]:
                output.append(word[i])
                break
    return output


print(StringMatching(['leetcode', 'et', 'code']))

'''
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: []
'''
def StringMatching(words):
    word = sorted(words, key = len)
    output = []

    for i in range(len(word)):
        for j in range(i+1, len(word)):
            if word[i] in word[j]:
                output.append(word[i])
                break
    
    return output

print(StringMatching(["leetcode","et","code"]))