Search
⌘K

Leetcode 2352. Equal Row and Column Pairs

Count the number of pairs (ri, cj) in an n×n integer matrix where the i-th row and j-th column are identical sequences. With n ≤ 200, the core challenge is efficiently comparing or matching row and column arrays (e.g., via hashing or frequency maps) to tally equal pairs.


Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Comments

Your account is free and you can post anonymously if you choose.