Given an array dominoes where each domino is represented as a pair of integers dominoes[i] = [a, b].

Two dominoes dominoes[i] = [a, b] and dominoes[j] = [c, d] are considered equivalent if and only if either (a == c and b == d) or (a == d and b == c), meaning one domino can be rotated to match the other.

Return the total number of pairs $(i, j)$ such that $0 \leq i < j <$ dominoes.length, where dominoes[i] is equivalent to dominoes[j].

Constraints:

• $1 \leq$ dominoes.length $\leq 4 imes 10^4$

• dominoes[i].length $= 2$

• $1 \leq$ dominoes[i][j] $\leq 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.