<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 sortedcontainers import SortedList
class Solution:
    def countCompleteSubstrings(self, word: str, k: int) -> int:
        letters = len(set(word))
        n = len(word)
        res = 0
        diffs = []
        for i in range(n):
            if i > 0 and abs(ord(word[i]) - ord(word[i-1])) > 2:
                diffs.append(i-1)
        
        m = len(diffs)
        for length in range(k,(letters+1)*k,k):
            freq = {}
            i = 0
            currdiff = -1
            while i < n:
                a = word[i]
                if a not in freq:
                    freq[a] = 0
                freq[a] += 1
                if i > length - 1:
                    freq[word[i-length]] -= 1
                    if freq[word[i-length]] == 0:
                        del freq[word[i-length]]
                if i >= length - 1 and (currdiff < 0 or diffs[currdiff] <= i - length) and all(freq[l] == k for l in freq):
                    res += 1
                i += 1
                if currdiff < m - 1 and i > diffs[currdiff+1]:
                    currdiff += 1

        return res
2933