Day3-Challenge.md

Problem Statement

Given a matrix(2D Array) M of size N*N consisting of 0s and 1s only. The task is to find the row with the maximum number of 0s.
Example:

Input:

      N=3
      1  1  1
      1  0  1
      1  0  0

Output:

      2

[Here the 2nd row(0- based indexing) is having 2 zeroes which is maximum among all columns]