In a row of dominoes, each domino has two halves, represented by two integer arrays tops and bottoms, where tops[i] and bottoms[i] denote the top and bottom values of the $i$-th domino tile respectively.

A rotation consists of swapping the top and bottom values of a domino tile at index i, swapping tops[i] and bottoms[i].

Return the minimum number of rotations required to make all the values in tops equal or all the values in bottoms equal. If it is impossible to make all values in either row equal, return $-1$.

Constraints:

• $2 \leq$ tops.length $\leq 2 imes 10^4$

• bottoms.length $==$ tops.length

• $1 \leq$ tops[i], bottoms[i] $\leq 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.