Number of Substrings With Fixed Ratio

Count how many substrings of a (typically binary) string have the counts of two characters in a given fixed ratio p:q. The core challenge is to map running character-counts to a canonical (normalized) form so you can aggregate occurrences and count all valid substrings efficiently rather than checking every substring.