Given an $m \times n$ matrix, determine whether it is a Toeplitz matrix. Return TRUE if it is, otherwise return FALSE.

A matrix is considered Toeplitz if every diagonal running from the top left to the bottom right contains identical elements. In other words, for every cell matrix[i][j], if both i + 1 and j + 1 are within bounds, then matrix[i][j] must equal matrix[i+1][j+1].

Note:

• What if the matrix is stored on disk and memory is limited such that you can only load at most one row of the matrix into memory at a time?

• What if the matrix is so large that you can only load a partial row into memory at once?

Constraints:

• $m$ $==$ matrix.length

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

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

• $0 \leq$ matrix[i][j] $\leq 99$

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.