Leetcode 1582. Special Positions in a Binary Matrix
Count the positions (i, j) in an m x n binary matrix that contain a 1 and are the only 1 in both their row and their column. Constraints: 1 <= m, n <= 100, mat[i][j] ∈ {0,1}.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Hello Interview Premium
Your account is free and you can post anonymously if you choose.