Given an integer d along with two integers low and high, return the total number of times the digit d appears across all integers in the inclusive range from low to high.

Constraints:

• $0 \leq$ d $\leq 9$

• $1 \leq$ low $\leq$ high $\leq 2 imes 10^8$

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.