You are given a positive integer n, representing an $n \times n$ $0$-indexed integer matrix mat initialized with all $0$s.

You are also given a $2$D integer array queries, where queries[i] $= [\text{row1}_i, \text{col1}_i, \text{row2}_i, \text{col2}_i]$. For each query, you must increment every cell mat[r][c] by $1$ for all r and c such that $\text{row1}_i \leq r \leq \text{row2}_i$ and $\text{col1}_i \leq c \leq \text{col2}_i$.

Return the matrix mat after processing all the queries.

Constraints:

• $1 \leq$ n $\leq 500$

• $1 \leq$ queries.length $\leq 10^4$

• $0 \leq \text{row1}_i \leq \text{row2}_i <$ n

• $0 \leq \text{col1}_i \leq \text{col2}_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.