A matrix diagonal is a diagonal line of cells starting from some cell in either the topmost row or leftmost column and going in the bottom right direction until reaching the edge of the matrix.

Given an $m \times n$ integer matrix mat, sort each matrix diagonal in ascending order and return the resulting matrix.

Constraints:

• m $==$ mat.length

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

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

• $1 \leq$ mat[i][j] $\leq 100$

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.