Toeplitz Matrix

Explore how to identify a Toeplitz matrix where each diagonal from top-left to bottom-right contains identical elements. Learn to implement a solution in Go, consider memory constraints, and understand efficient handling of matrix data in coding interviews.

We'll cover the following...

Statement
Examples
Understand the problem
Figure it out!
Try it yourself

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