class Solution {
  public int equalPairs(int[][] grid) {
    int count = 0, n = grid.length;

    // Check each row r against each column c.
    for (int r = 0; r < n; ++r) {
      for (int c = 0; c < n; ++c) {
        boolean match = true;

        // Iterate over row r and column c.
        for (int i = 0; i < n; ++i) {
          if (grid[r][i] != grid[i][c]) {
            match = false;
            break;
          }
        }

        // If row r equals column c, increment count by 1.
        if (match) {
          count++;
        }
      }
    }

    return count;
  }
}