Given an m by n binary matrix mat, determine the $0$ indexed row that contains the maximum number of ones, along with the count of ones present in that row.

If multiple rows share the same maximum count of ones, select the row with the smallest index.

Return an array of length $2$ containing the selected row index and the maximum count of ones.

Constraints:

• m $==$ mat.length

• n $==$ mat[i].length

• $1 \leq$ m, n $\leq 100$

• mat[i][j] is either $0$ or $1$.

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.