You are given an m $ imes$ n integer matrix initialized with all $0$s, and a $2$D array of integers ops where each operation is represented as ops[i] $= [a_i, b_i]$.

For each operation ops[i], all cells in the matrix with row index $r$ and column index $c$ satisfying $0 \leq r < a_i$ and $0 \leq c < b_i$ are incremented by $1$.

Return the number of cells in the matrix that contain the maximum value after executing all operations in ops.

Constraints:

• $1 \leq$ m, n $\leq 4 imes 10^4$

• $0 \leq$ ops.length $\leq 10^4$

• ops[i].length $= 2$

• $1 \leq$ a_i $\leq$ m

• $1 \leq$ b_i $\leq$ 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.