lumin/my-solutions
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity
my-solutions/leetcode/1582-special-positions-in-a-binary-matrix
History
Ivan 283cbb492d
Update readme, rename problems directory
2023-11-29 11:09:53 +05:00
..
main.rb Update readme, rename problems directory 2023-11-29 11:09:53 +05:00
readme.md Update readme, rename problems directory 2023-11-29 11:09:53 +05:00
test.rb Update readme, rename problems directory 2023-11-29 11:09:53 +05:00

readme.md

1582. Special Positions in a Binary Matrix

Given an m x n binary matrix mat, return the number of special positions in mat.

A position (i, j) is called special if mat[i][j] == 1 and all other elements in row i and column j are 0 (rows and columns are 0-indexed).