766. Toeplitz Matrix

Toeplitz Matrix

Problem Description

Given an m x n matrix, return true if the matrix is Toeplitz. Otherwise, return false.

A matrix is Toeplitz if every diagonal from top-left to bottom-right has the same elements.

 

Example 1:

Input: matrix = [[1,2,3,4],[5,1,2,3],[9,5,1,2]]
Output: true

Explanation:
In the above grid, the diagonals are:
"[9]", "[5, 5]", "[1, 1, 1]", "[2, 2, 2]", "[3, 3]", "[4]".
In each diagonal all elements are the same, so the answer is True.

Example 2:

Input: matrix = [[1,2],[2,2]]
Output: false

Explanation:
The diagonal "[1, 2]" has different elements.

 

Constraints:

• m == matrix.length
• n == matrix[i].length
• 1 <= m, n <= 20
• 0 <= matrix[i][j] <= 99

 

Follow up:

• What if the matrix is stored on disk, and the memory is limited such that you can only load at most one row of the matrix into the memory at once?
• What if the matrix is so large that you can only load up a partial row into the memory at once?

Approach) Brute Force

/**
 * @param {number[][]} matrix
 * @return {boolean}
 */
var isToeplitzMatrix = function(matrix) {
    let row = matrix[0].length;
    let col = matrix.length;
    for(let i=1;i<col;i++){
        for(let j=1;j<row;j++){
            if(matrix[i][j] != matrix[i-1][j-1]){
                return false
            }
        }
    }
    
    return true;
};


/*
Diagonal:
Indexes :   [{0,0},{1,1},{2,2}], 
            [{0,2},{1,3},{2,4}], 
            [{0,3},{1,4}], 
            [{0,4}],
            [{1,0},{2,1}],
            [{2,0}]
*/

Approach) Brute Force (Another)

var isToeplitzMatrix = function(matrix) {
    for (var i = matrix.length - 1; i>0; i--) {
        if(matrix[i].slice(1, matrix[i].length).join('') !== matrix[i-1].slice(0, matrix[i].length - 1).join('')) {
            return false;
        }
    }
    return true;
};

Conclusion

That’s all folks! In this post, we solved LeetCode problem #766. Toeplitz Matrix

I hope you have enjoyed this post. Feel free to share your thoughts on this.

You can find the complete source code on my GitHub repository. If you like what you learn. feel free to fork 🔪 and star ⭐ it.

In this blog, I have tried to collect & present the most important points to consider when improving Data structure and logic, feel free to add, edit, comment, or ask. For more information please reach me here
Happy coding!