<p>We are given <code>n</code> different types of <code>stickers</code>. Each sticker has a lowercase English word on it.</p>

<p>You would like to spell out the given string <code>target</code> by cutting individual letters from your collection of stickers and rearranging them. You can use each sticker more than once if you want, and you have infinite quantities of each sticker.</p>

<p>Return <em>the minimum number of stickers that you need to spell out </em><code>target</code>. If the task is impossible, return <code>-1</code>.</p>

<p><strong>Note:</strong> In all test cases, all words were chosen randomly from the <code>1000</code> most common US English words, and <code>target</code> was chosen as a concatenation of two random words.</p>

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

<pre>
<strong>Input:</strong> stickers = [&quot;with&quot;,&quot;example&quot;,&quot;science&quot;], target = &quot;thehat&quot;
<strong>Output:</strong> 3
<strong>Explanation:</strong>
We can use 2 &quot;with&quot; stickers, and 1 &quot;example&quot; sticker.
After cutting and rearrange the letters of those stickers, we can form the target &quot;thehat&quot;.
Also, this is the minimum number of stickers necessary to form the target string.
</pre>

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

<pre>
<strong>Input:</strong> stickers = [&quot;notice&quot;,&quot;possible&quot;], target = &quot;basicbasic&quot;
<strong>Output:</strong> -1
Explanation:
We cannot form the target &quot;basicbasic&quot; from cutting letters from the given stickers.
</pre>

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

<ul>
	<li><code>n == stickers.length</code></li>
	<li><code>1 &lt;= n &lt;= 50</code></li>
	<li><code>1 &lt;= stickers[i].length &lt;= 10</code></li>
	<li><code>1 &lt;= target.length &lt;= 15</code></li>
	<li><code>stickers[i]</code> and <code>target</code> consist of lowercase English letters.</li>
</ul>

class Solution {
public:
    int minStickers(vector<string>& stickers, string target) {
        int n = stickers.size();
        vector<vector<int> > table(n, vector<int>(26, 0));
        vector<int> temp(26, 0);
        for(int i=0;i<n;i++) {
            for(char c:stickers[i]) {
                table[i][c-'a']++;
                temp[c-'a']++;
            }
        }
        vector<int> target_arr(26, 0);
        for(char c:target) {
            target_arr[c-'a']++;
        }
        for(int i=0;i<26;i++) {
            if(target_arr[i] && !temp[i]) return -1;
        }
        cout<<"p";
        queue<vector<int>> q;
        q.push(target_arr);
        int steps = 0;
        unordered_set<string> vis;
        // int steps = 0;
        while(q.empty() == false) {
           int sz = q.size();
           while(sz--) {
            
            vector<int> aux = q.front();
            q.pop();
            string s = "";
            for(int i=0;i<26;i++) {
                if(aux[i] > 0) {
                    
                    s += string(aux[i], (char)(i+97));
                    
                }
            }
            cout<<s<<"\n";
            if(s == "") {
                return steps;
            }
            
            if(vis.count(s)) continue;
            vis.insert(s);
            for(vector<int>&arr: table) {
                
                if(arr[s[0]-'a']) {
                    
                    vector<int> tmp = aux;
                    for(int i=0;i<26;i++) {
                        tmp[i] -= arr[i];
                    }
                    q.push(tmp);
                }
            }
           }
           steps++;
        }
        return -1; 
    }
};
52468