Given a positive integer n, return the count of special integers in the inclusive range from $1$ to n.

A positive integer is considered special if all of its digits are unique.

Constraints:

• $1 \leq$ n $\leq 2 imes 10^9$

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.