<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:
    bool helper(string s,int i,map<string,int>&h,map<string,int>&ans,map<string,int>&cuts){
        if(ans.count(s.substr(i))){
            return ans[s.substr(i)];
        }
        for(int j=i;j<s.size();j++){
            string s1=s.substr(i,j-i+1) ;
            if(h.count(s1)==0){
                continue;
            }
            if(j==s.size()-1){
                return ans[s.substr(i)]=1;
            }
            string s2=s.substr(j+1);
            bool c=helper(s,j+1,h,ans,cuts);
            if(c){
                cuts[s.substr(i)]=cuts[s2]+1;
                return ans[s.substr(i)]=1;
            }
        }
        return ans[s.substr(i)]=0;
    }
    vector<string> findAllConcatenatedWordsInADict(vector<string>& words) {
        int n=words.size();
        map<string,int>h;
        for(int i=0;i<n;i++){
            h[words[i]]=1;
        }
        vector<string>v;
       // return v;
        map<string,int>ans;
        map<string,int>cuts;
        for(int i=0;i<n;i++){
            string s=words[i];
            bool c=helper(s,0,h,ans,cuts);
            if(c&&cuts[s]>0){
                v.push_back(s);
            }
            cout<<s<<" "<<cuts[s]<<endl;
        }
        return v;
    }
   


};
81966