You are given an integer n consisting of $3$ digits.

You obtain a concatenated string by joining n, $2 imes$ n, and $3 imes$ n sequentially.

The number n is considered fascinating if the concatenated string contains every digit from $1$ to $9$ exactly once and contains no $0$.

Return true if n is fascinating, or false otherwise.

Constraints:

• $100 \leq$ n $\leq 999$

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.