Leetcode 2067. Number of Equal Count Substrings

Count substrings of a given string in which every distinct character appears the same number of times. The challenge is to detect and efficiently count identical normalized frequency patterns across substrings (e.g., by using prefix counts or hashing) without examining every substring naively.