<p>Given an array of string <code>words</code>, return <em>all strings in </em><code>words</code><em> that is a <strong>substring</strong> of another word</em>. You can return the answer in <strong>any order</strong>.</p>

<p>A <strong>substring</strong> is a contiguous sequence of characters within a string</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> words = [&quot;mass&quot;,&quot;as&quot;,&quot;hero&quot;,&quot;superhero&quot;]
<strong>Output:</strong> [&quot;as&quot;,&quot;hero&quot;]
<strong>Explanation:</strong> &quot;as&quot; is substring of &quot;mass&quot; and &quot;hero&quot; is substring of &quot;superhero&quot;.
[&quot;hero&quot;,&quot;as&quot;] is also a valid answer.
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> words = [&quot;leetcode&quot;,&quot;et&quot;,&quot;code&quot;]
<strong>Output:</strong> [&quot;et&quot;,&quot;code&quot;]
<strong>Explanation:</strong> &quot;et&quot;, &quot;code&quot; are substring of &quot;leetcode&quot;.
</pre>

<p><strong class="example">Example 3:</strong></p>

<pre>
<strong>Input:</strong> words = [&quot;blue&quot;,&quot;green&quot;,&quot;bu&quot;]
<strong>Output:</strong> []
<strong>Explanation:</strong> No string of words is substring of another string.
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= words.length &lt;= 100</code></li>
	<li><code>1 &lt;= words[i].length &lt;= 30</code></li>
	<li><code>words[i]</code> contains only lowercase English letters.</li>
	<li>All the strings of <code>words</code> are <strong>unique</strong>.</li>
</ul>

class Solution {
public:
    static bool tempComparator(string s1, string s2){
        return s1.size()<s2.size();
    }
    void computeLPS(string s, vector<int> &lps){
        int i=1, len = 0;
        while(i<s.size()){
            if(s[i] == s[len]){
                len++;
                lps[i] = len;
                i++;
            } else {
                if(len!=0) len = lps[len-1];
                else i++;
            }
        }
    }
    bool search(string s1, string s2){
        int n = s1.size(), m = s2.size();
        vector<int> lps(m, 0);
        computeLPS(s2, lps);
        int i=0, j=0;
        while((n-i) >= (m-j)){
            if(s1[i] == s2[j]){
                i++;
                j++;
            }
            if(j == m) return true;
            else if(i<n && s1[i] != s2[j]){
                if(j!=0) j = lps[j-1];
                else i++;
            }
        }
        return false;
    }
    vector<string> stringMatching(vector<string>& words) {
        vector<string> result;
        sort(words.begin(), words.end(), tempComparator);
        for(int i=0;i<words.size();i++){
            for(int j=i+1;j<words.size();j++){
                if(search(words[j], words[i])){
                    result.push_back(words[i]);
                    break;
                }
            }
        }
        return result;
    }
};
16000