You are given an array nums consisting of positive integers.

Two integers $x$ and $y$ are considered almost equal if it is possible to make them equal by swapping at most one pair of digits in at most one of the numbers. Swapping can be performed after optionally appending leading zeros to the number with fewer digits so that both numbers have the same number of digits.

Return the total number of index pairs $(i, j)$ such that $0 \leq i < j <$ nums.length where nums[i] and nums[j] are almost equal.

Constraints:

• $2 \leq$ nums.length $\leq 100$

• $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.