Given an integer n, return the count of positive integers in the range $[1, n]$ that contain at least one repeated digit.

Constraints:

• $1 \le n \le 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.