<p>Given an array of strings <code>words</code> (<strong>without duplicates</strong>), return <em>all the <strong>concatenated words</strong> in the given list of</em> <code>words</code>.</p>

<p>A <strong>concatenated word</strong> is defined as a string that is comprised entirely of at least two shorter words (not necessarily distinct)&nbsp;in the given array.</p>

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

<pre>
<strong>Input:</strong> words = [&quot;cat&quot;,&quot;cats&quot;,&quot;catsdogcats&quot;,&quot;dog&quot;,&quot;dogcatsdog&quot;,&quot;hippopotamuses&quot;,&quot;rat&quot;,&quot;ratcatdogcat&quot;]
<strong>Output:</strong> [&quot;catsdogcats&quot;,&quot;dogcatsdog&quot;,&quot;ratcatdogcat&quot;]
<strong>Explanation:</strong> &quot;catsdogcats&quot; can be concatenated by &quot;cats&quot;, &quot;dog&quot; and &quot;cats&quot;; 
&quot;dogcatsdog&quot; can be concatenated by &quot;dog&quot;, &quot;cats&quot; and &quot;dog&quot;; 
&quot;ratcatdogcat&quot; can be concatenated by &quot;rat&quot;, &quot;cat&quot;, &quot;dog&quot; and &quot;cat&quot;.</pre>

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

<pre>
<strong>Input:</strong> words = [&quot;cat&quot;,&quot;dog&quot;,&quot;catdog&quot;]
<strong>Output:</strong> [&quot;catdog&quot;]
</pre>

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

<ul>
	<li><code>1 &lt;= words.length &lt;= 10<sup>4</sup></code></li>
	<li><code>1 &lt;= words[i].length &lt;= 30</code></li>
	<li><code>words[i]</code> consists of only lowercase English letters.</li>
	<li>All the strings of <code>words</code> are <strong>unique</strong>.</li>
	<li><code>1 &lt;= sum(words[i].length) &lt;= 10<sup>5</sup></code></li>
</ul>

class Solution {
public:

    int f(string &curr,unordered_set<string> &data,vector<vector<int>> &dp,int ind,int pre,string match)
    {
           if(ind==curr.size())
           {
              if(data.find(match)!=data.end() && match!=curr)
              return 1;
              return 0;
           }
           if(dp[ind][pre]!=-1)
           return dp[ind][pre];
            int a=0,b=0;
           if(data.find(match)!=data.end())
           {
              a=f(curr,data,dp,ind,ind,"");
             
           }
           match.push_back(curr[ind]);
        //    cout<<match<<endl;
           b=f(curr,data,dp,ind+1,pre,match);
             return dp[ind][pre]=a || b;
    }
    vector<string> findAllConcatenatedWordsInADict(vector<string>& words) {
        

          unordered_set<string> data;
          for(auto i:words)
          data.insert(i);

          vector<string> ans;
          for(auto curr:words)
          {
            vector<vector<int>> dp(curr.size()+1,vector<int> (curr.size()+1,-1));
            int a=0;
             a=f(curr,data,dp,0,0,"");
            if(a)
            ans.push_back(curr);
          }
          return ans;
    }
};
182526