<p>You are given a string <code>word</code> and an integer <code>k</code>.</p>

<p>A substring <code>s</code> of <code>word</code> is <strong>complete</strong> if:</p>

<ul>
	<li>Each character in <code>s</code> occurs <strong>exactly</strong> <code>k</code> times.</li>
	<li>The difference between two adjacent characters is <strong>at most</strong> <code>2</code>. That is, for any two adjacent characters <code>c1</code> and <code>c2</code> in <code>s</code>, the absolute difference in their positions in the alphabet is <strong>at most</strong> <code>2</code>.</li>
</ul>

<p>Return <em>the number of <strong>complete </strong>substrings of</em> <code>word</code>.</p>

<p>A <strong>substring</strong> is a <strong>non-empty</strong> contiguous sequence of characters in a string.</p>

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

<pre>
<strong>Input:</strong> word = &quot;igigee&quot;, k = 2
<strong>Output:</strong> 3
<strong>Explanation:</strong> The complete substrings where each character appears exactly twice and the difference between adjacent characters is at most 2 are: <u><strong>igig</strong></u>ee, igig<u><strong>ee</strong></u>, <u><strong>igigee</strong></u>.
</pre>

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

<pre>
<strong>Input:</strong> word = &quot;aaabbbccc&quot;, k = 3
<strong>Output:</strong> 6
<strong>Explanation:</strong> The complete substrings where each character appears exactly three times and the difference between adjacent characters is at most 2 are: <strong><u>aaa</u></strong>bbbccc, aaa<u><strong>bbb</strong></u>ccc, aaabbb<u><strong>ccc</strong></u>, <strong><u>aaabbb</u></strong>ccc, aaa<u><strong>bbbccc</strong></u>, <u><strong>aaabbbccc</strong></u>.
</pre>

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

<ul>
	<li><code>1 &lt;= word.length &lt;= 10<sup>5</sup></code></li>
	<li><code>word</code> consists only of lowercase English letters.</li>
	<li><code>1 &lt;= k &lt;= word.length</code></li>
</ul>

from collections import defaultdict, deque

class Solution:
    def countCompleteSubstrings(self, s: str, k: int) -> int:
        def func(l):
            for i in l:
                if i!=0 and i!= k:
                    return False
            return True

        n = len(s)
        uniq = len(set(s))
        ct = 0

        for t in range(1, uniq + 1):
            lenn = t * k
            start = 0
            end = start+lenn - 1
            freq = [0 for _ in range(26)] 
            q = deque() 

            for i in range(start, min(end + 1, n)):
                freq[ord(s[i]) - ord('a')] += 1
                if i > start:
                    diff = abs(ord(s[i]) - ord(s[i - 1]))
                    q.append(diff)

            while end < n:
                if func(freq) and (not q or max(q) <= 2):
                    ct += 1

                if q:
                    q.popleft() 

                freq[ord(s[start]) - ord('a')] -= 1
                start += 1
                end += 1
                if end < n:
                    freq[ord(s[end]) - ord('a')] += 1
                    if end > start:
                        diff = abs(ord(s[end]) - ord(s[end - 1]))
                        q.append(diff)

        return ct

4852