  Showing: Handle Score
@Ibrahim Nash 6560
@mb1973 5777
@Quandray 5271
@akhayrutdinov 5111
@saiujwal13083 5074
@kirtidee18 4356
@sanjay05 3762
@mantu_singh 3638
@gfgaccount 3601
@marius_valentin_dragoi 3525
Count zeros in a sorted matrix
Basic Accuracy: 59.65% Submissions: 17557 Points: 1

Given a N X N binary Square Matrix where each row and column of the matrix is sorted in ascending order. Find the total number of zeros present in the matrix.

Example 1:

Input:
N = 3
A = {{0, 0, 0},
{0, 0, 1},
{0, 1, 1}}
Output: 6
Explanation:
The first, second and third row contains 3, 2 and 1
zeroes respectively.

Example 2:

Input:
N = 2
A = {{1, 1},
{1, 1}}
Output: 0
Explanation:
There are no zeroes in any of the rows.

You don't need to read input or print anything. Your task is to complete the function countZeros() which takes a 2D matrix as input and returns the number occurring only once.

Expected Time Complexity: O(N ).
Expected Auxiliary Space: O(1).

Constraints
0 <   N  <= 103
0 <= A[i] <= 1

### Editorial

We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?

#### My Submissions:  