<p>You are given a string <code>s</code> and an array of strings <code>words</code>. All the strings of <code>words</code> are of <strong>the same length</strong>.</p>

<p>A <strong>concatenated string</strong> is a string that exactly contains all the strings of any permutation of <code>words</code> concatenated.</p>

<ul>
	<li>For example, if <code>words = [&quot;ab&quot;,&quot;cd&quot;,&quot;ef&quot;]</code>, then <code>&quot;abcdef&quot;</code>, <code>&quot;abefcd&quot;</code>, <code>&quot;cdabef&quot;</code>, <code>&quot;cdefab&quot;</code>, <code>&quot;efabcd&quot;</code>, and <code>&quot;efcdab&quot;</code> are all concatenated strings. <code>&quot;acdbef&quot;</code> is not a concatenated string because it is not the concatenation of any permutation of <code>words</code>.</li>
</ul>

<p>Return an array of <em>the starting indices</em> of all the concatenated substrings in <code>s</code>. You can return the answer in <strong>any order</strong>.</p>

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

<div class="example-block">
<p><strong>Input:</strong> <span class="example-io">s = &quot;barfoothefoobarman&quot;, words = [&quot;foo&quot;,&quot;bar&quot;]</span></p>

<p><strong>Output:</strong> <span class="example-io">[0,9]</span></p>

<p><strong>Explanation:</strong></p>

<p>The substring starting at 0 is <code>&quot;barfoo&quot;</code>. It is the concatenation of <code>[&quot;bar&quot;,&quot;foo&quot;]</code> which is a permutation of <code>words</code>.<br />
The substring starting at 9 is <code>&quot;foobar&quot;</code>. It is the concatenation of <code>[&quot;foo&quot;,&quot;bar&quot;]</code> which is a permutation of <code>words</code>.</p>
</div>

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

<div class="example-block">
<p><strong>Input:</strong> <span class="example-io">s = &quot;wordgoodgoodgoodbestword&quot;, words = [&quot;word&quot;,&quot;good&quot;,&quot;best&quot;,&quot;word&quot;]</span></p>

<p><strong>Output:</strong> <span class="example-io">[]</span></p>

<p><strong>Explanation:</strong></p>

<p>There is no concatenated substring.</p>
</div>

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

<div class="example-block">
<p><strong>Input:</strong> <span class="example-io">s = &quot;barfoofoobarthefoobarman&quot;, words = [&quot;bar&quot;,&quot;foo&quot;,&quot;the&quot;]</span></p>

<p><strong>Output:</strong> <span class="example-io">[6,9,12]</span></p>

<p><strong>Explanation:</strong></p>

<p>The substring starting at 6 is <code>&quot;foobarthe&quot;</code>. It is the concatenation of <code>[&quot;foo&quot;,&quot;bar&quot;,&quot;the&quot;]</code>.<br />
The substring starting at 9 is <code>&quot;barthefoo&quot;</code>. It is the concatenation of <code>[&quot;bar&quot;,&quot;the&quot;,&quot;foo&quot;]</code>.<br />
The substring starting at 12 is <code>&quot;thefoobar&quot;</code>. It is the concatenation of <code>[&quot;the&quot;,&quot;foo&quot;,&quot;bar&quot;]</code>.</p>
</div>

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

<ul>
	<li><code>1 &lt;= s.length &lt;= 10<sup>4</sup></code></li>
	<li><code>1 &lt;= words.length &lt;= 5000</code></li>
	<li><code>1 &lt;= words[i].length &lt;= 30</code></li>
	<li><code>s</code> and <code>words[i]</code> consist of lowercase English letters.</li>
</ul>

class Solution {
public:
    vector<int> findSubstring(string s, vector<string>& words) {
        int j = words[0].size();
        int n = words.size();
        int len = j * n;

        vector<int> ans;

        for(int start = 0; start < j; start++) {
            vector<string> temp;
            for(int i = start; i < s.size(); i+= j) {
                int k = i;
                int temp_len = j;
                string h = "";
                while(temp_len && k < s.size()) {
                    temp_len--;
                    h = h + s[k];
                    k++;
                }
                if(h.size() == j) {
                    temp.push_back(h);
                }
            }
            for(auto i : temp) cout<<i<<" ";
            cout<<endl;

            map<string, int> mp;
            for(auto s:words) mp[s]++;
            int map_size = mp.size();

            if(words.size() > temp.size())
                continue;

            for(int in = 0; in < words.size(); in++) {
                if(mp.find(temp[in]) != mp.end()) {
                    mp[temp[in]]--;
                    if(mp[temp[in]] == 0) {
                        map_size--;
                    }
                }
            }
            if(map_size == 0) {
                ans.push_back(start);
            }

            for(int in = words.size(); in < temp.size(); in++) {
                int remove = in - words.size();
                int add = in;
                
                if(mp.find(temp[in]) != mp.end()) {
                    mp[temp[in]]--;
                    if(mp[temp[in]] == 0) {
                        map_size--;
                    }
                }

                if(mp.find(temp[remove]) != mp.end()) {
                    mp[temp[remove]]++;
                    if(mp[temp[remove]] == 1) {
                        map_size++;
                    }
                }

                if(map_size == 0) {
                    ans.push_back(start + j * (remove + 1));
                }
            }
            
        }

        return ans;
    }
};
80112