Given a $0$ indexed $n imes n$ integer matrix grid, return the total number of pairs $(r_i, c_j)$ such that row $r_i$ and column $c_j$ are equal.

A row and column pair is considered equal if they contain the same elements in the exact same order.

Constraints:

• n = grid.length = grid[i].length

• $1 \leq$ n $\leq 200$

• $1 \leq$ grid[i][j] $\leq 10^5$

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.