You are given an array nums of positive integers.

You must take the reverse of the digits of each integer in the array and append it to the end of nums.

Return the total number of distinct integers present in the resulting array.

Note: Reversing an integer removes any leading zeros (for example, reversing $10$ results in $1$).

Constraints:

• $1 \leq$ nums.length $\leq 10^5$

• $1 \leq$ nums[i] $\leq 10^6$

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.