You are given two positive integers low and high.

An integer consisting of $2 \cdot n$ digits is defined as symmetric if the sum of its first $n$ digits is equal to the sum of its last $n$ digits. Numbers composed of an odd number of digits are never symmetric.

Return the count of symmetric integers in the inclusive range $[$low, high$]$.

Constraints:

• $1 \leq$ low $\leq$ high $\leq 10^4$

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.