Timer is Running

Associated Course(s):
Interview Preparation

Given a 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.

**Input:**

The first line of input will be the no of test cases then T test cases will follow. The second line of each test case contains an integer N denoting the dimension of the matrix. Then in the next line are the space separated values of the matrix A[ ] [ ].

**Output:**

Print in a single line, the total number of zeros present in the given Binary Matrix.

**User Task:**

You don't need to read input or print anything. Your task is to complete the function **countZeros() **which takes the Binary Matrix A[][] and its size N as inputs and returns an integer denoting the total number of Zeros present in the matrix.

**Expected Time Complexity: **O(N).

**Expected Auxiliary Space: **O(1).

**Constraints:**

1<=T<=50

1<=M,N<=1000

0<=A[][]<=1

**Example:
Input**

2

3

0 0 0 0 0 1 0 1 1

2

1 1 1 1

6

4

**Note:**The **Input/Ouput** format and **Example** given are used for system's internal purpose, and should be used by a user for **Expected Output** only. As it is a function problem, hence a user should not read any input from stdin/console. The task is to complete the function specified, and not to write the full code.

Author: Shubham Joshi 1

If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.

abnandi04 | 801 |

KshamaGupta | 412 |

srivastavad270 | 223 |

bhavyapratap56 | 206 |

anshusingh20112001 | 181 |

abnandi04 | 776 |

KshamaGupta | 296 |

srivastavad270 | 223 |

bhavyapratap56 | 206 |

afreensartaj131 | 170 |

blackshadows | 5362 |

Ibrahim Nash | 5244 |

akhayrutdinov | 5111 |

mb1973 | 4976 |

Quandray | 4748 |

Login to report an issue on this page.