<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:
    def findSubstring(self, s: str, words: List[str]) -> List[int]:
        in_mp = defaultdict(lambda: False)
        mp = defaultdict(lambda: 0)
        ans = []
        wordLen = len(words[0])
        noWords = len(words)
        n = len(s)
        diffWords = 0
        for word in words:
            mp[tuple(word)] += 1
            if (not in_mp[tuple(word)]):
                diffWords += 1
            in_mp[tuple(word)] = True
        
        for i in range(wordLen):
            cur_mp = defaultdict(lambda: 0)
            tot = 0
            if (i + wordLen * noWords > n): #Im not sure
                break
            for j in range(i, i + wordLen * noWords, wordLen):
                smallWord = ""
                for k in range(j, j + wordLen):
                    smallWord += s[k]
                tupleWord = tuple(smallWord)
                if (in_mp[tupleWord]):
                    cur_mp[tupleWord] += 1
                    if (cur_mp[tupleWord] == mp[tupleWord]):
                        tot += 1
                    if (cur_mp[tupleWord] == mp[tupleWord] + 1):
                        tot -= 1
            # print(i, tot)
            if (tot == diffWords):
                ans.append(i)
            for j in range(i + wordLen * noWords, n, wordLen):
                if (j + wordLen > n):
                    break
                addSmallWord = ""
                removeSmallWord = ""
                for k in range(j, j + wordLen):
                    addSmallWord += s[k]
                    removeSmallWord += s[k - wordLen *  noWords]
                tupleAdd = tuple(addSmallWord)
                tupleRemove = tuple(removeSmallWord)
                if (in_mp[tupleAdd]):
                    # print(tupleAdd)
                    cur_mp[tupleAdd] += 1
                    # print(cur_mp[tupleAdd], mp[tupleAdd])
                    if (cur_mp[tupleAdd] == mp[tupleAdd]):
                        tot += 1
                    if (cur_mp[tupleAdd] == mp[tupleAdd] + 1):
                        tot -= 1
                if (in_mp[tupleRemove]):
                    # print(tupleRemove)
                    cur_mp[tupleRemove] -= 1
                    # print(cur_mp[tupleRemove], mp[tupleRemove])
                    if (cur_mp[tupleRemove] == mp[tupleRemove]):
                        tot += 1
                    if (cur_mp[tupleRemove] == mp[tupleRemove] - 1):
                        tot -= 1
                # print(j, tot)
                if (tot == diffWords):
                    ans.append(j + wordLen - (noWords * wordLen))
                    
        return ans
            

19500