You are given an array nums consisting of positive integers where all integers have an equal number of digits.

The digit difference between two integers of equal length is defined as the count of positions where the digits at the corresponding positions are not equal.

Return the total sum of the digit differences across all pairs of elements (nums[i], nums[j]) where $0 \leq i < j <$ nums.length.

Constraints:

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

• $1 \leq$ nums[i] $< 10^9$

• All integers in nums have the same number of digits.

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.