Solution: Toeplitz Matrix

Understand how to check whether a matrix is a Toeplitz matrix by comparing each element to its diagonal neighbor. This lesson teaches you to efficiently validate diagonals using nested loops, achieving optimal time and space complexity while handling matrix constraints.

We'll cover the following...

Statement
Solution
- Time complexity
- Space complexity

Statement

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
...