Available question text
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}.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 1582. Special Positions in a Binary Matrix
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source