Please solve the programming task below using a self-contained code snippet in a markdown code block.

You are given a 0-indexed string s consisting of only lowercase English letters, and an integer count. A substring of s is said to be an equal count substring if, for each unique letter in the substring, it appears exactly count times in the substring.
Return the number of equal count substrings in s.
A substring is a contiguous non-empty sequence of characters within a string.
 
Please complete the following python code precisely:
```python
class Solution:
    def equalCountSubstrings(self, s: str, count: int) -> int:
```