Given two integers m and n representing the dimensions of an m $ imes$ n matrix initialized with all $0$ values, and a two dimensional integer array indices where each element indices[i] = [r_i, c_i].

For each pair [r_i, c_i], apply the following operations:

1. Increment all elements in row r_i by $1$.

2. Increment all elements in column c_i by $1$.

Return the number of cells in the matrix with odd values after processing all pairs in indices.

Constraints:

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

• $1 \leq$ indices.length $\leq 100$

• $0 \leq$ r_i $<$ m

• $0 \leq$ c_i $<$ n

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.