Geeksforgeeks

Error

×

Leaderboard

Showing:

Handle | Score |
---|---|

@Ibrahim Nash | 6560 |

@blackshadows | 6400 |

@mb1973 | 5777 |

@Quandray | 5271 |

@akhayrutdinov | 5111 |

@saiujwal13083 | 5074 |

@kirtidee18 | 4356 |

@sanjay05 | 3762 |

@mantu_singh | 3638 |

@gfgaccount | 3601 |

@marius_valentin_dragoi | 3525 |

Complete Leaderboard | |

Handle | Score |

@anish5256 | 991 |

@vimleshpratapsingh321 | 980 |

@skj7 | 871 |

@akhileshkumar562002 | 862 |

@pradeeppatidar1999 | 840 |

@kanewilliamson123 | 837 |

@pd420786 | 813 |

@infilooop | 800 |

@bunnybug320 | 796 |

@smitabose7826 | 784 |

@virgat | 768 |

Complete Leaderboard |

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.

**Your Task:**

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** <= 10^{3}

0 <= **A[i]** <= 1

Login to report an issue on this page.

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

YesLoading...

Count zeros in a sorted matrix

...