<p>Given two strings <code>s</code> and <code>p</code>, return an array of all the start indices of <code>p</code>&#39;s <span data-keyword="anagram">anagrams</span> in <code>s</code>. You may return the answer in <strong>any order</strong>.</p>

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

<pre>
<strong>Input:</strong> s = &quot;cbaebabacd&quot;, p = &quot;abc&quot;
<strong>Output:</strong> [0,6]
<strong>Explanation:</strong>
The substring with start index = 0 is &quot;cba&quot;, which is an anagram of &quot;abc&quot;.
The substring with start index = 6 is &quot;bac&quot;, which is an anagram of &quot;abc&quot;.
</pre>

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

<pre>
<strong>Input:</strong> s = &quot;abab&quot;, p = &quot;ab&quot;
<strong>Output:</strong> [0,1,2]
<strong>Explanation:</strong>
The substring with start index = 0 is &quot;ab&quot;, which is an anagram of &quot;ab&quot;.
The substring with start index = 1 is &quot;ba&quot;, which is an anagram of &quot;ab&quot;.
The substring with start index = 2 is &quot;ab&quot;, which is an anagram of &quot;ab&quot;.
</pre>

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

<ul>
	<li><code>1 &lt;= s.length, p.length &lt;= 3 * 10<sup>4</sup></code></li>
	<li><code>s</code> and <code>p</code> consist of lowercase English letters.</li>
</ul>

class Solution:
    def findAnagrams(self, s: str, p: str) -> List[int]:
        res = {}
        for char in p:
            if char in res:
                res[char] += 1
            else:
                res[char] = 1

        size = len(res)
        k = len(p)
        i, j = 0, 0
        ans = []

        while j < len(s):

            if s[j] in res:
                res[s[j]] -= 1
                if res[s[j]] == 0:
                    size -= 1
            if j - i + 1 < k:
                j += 1
            
            elif j - i + 1 == k:
                if size == 0:
                    ans.append(i)
                
                if s[i] in res:
                    res[s[i]] += 1
                    if res[s[i]] == 1:
                        size += 1
                
                i += 1
                j += 1

        return ans

        
17700