Given two positive integers a and b, return the total count of numbers in the inclusive range $[$a, b$]$ where every digit is unique and no digit appears more than once.

Constraints:

• $1 \leq$ a $\leq$ b $\leq 1000$

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.