Given two integers low and high, return the number of balanced integers in the inclusive range from low to high.

An integer is defined as balanced if the sum of its digits at odd positions is equal to the sum of its digits at even positions, where digit positions are numbered starting from $1$ from left to right.

Constraints:

• $1 \leq$ low $\leq$ high $\leq 10^{15}$

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.