You are given a binary string s and two integers num1 and num2.

A substring of s is considered valid if the ratio of the number of $0$s to the number of $1$s in the substring is equal to num1 to num2.

Return the total number of non empty valid substrings of s.

Constraints:

• $1 \leq$ s.length $\leq 10^5$

• $1 \leq$ num1, num2 $\leq$ s.length

• num1 and num2 are coprime integers.

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.