766. Toeplitz Matrix | Leetcode Hindi | Java

Hi folks! Comeback kar rhe h break ke baad let's go.
Here we are solving766. Toeplitz Matrix
|| LeetcodeJava || O(M*N) time complexity || O(1) Space complexity
Easy explanation in Hindi.
Problem link: leetcode.com/problems/toeplit...
If you have any queries reach out to me at
linktr.ee/udyanojha

[@amanraheja2905]

Bhai, mai ekdum yahi so raha tha par aapne kitni asaani se bta diya. Well done 👍

[@udyanishere]

Awesome h ye toh Aman bhai… lessgo 🔥

[@itsmesohit]

happy to see you again

[@udyanishere]

Thank you so much bhai!

[@anishbishnoi29xD]

continue karo bhai series ab se 😃

[@udyanishere]

Anish bhai! Connect me on Linkedin thoda time aur lagega regular aane me. Thank you so much for being here always.

[@udyanishere]

Hi! Anish. Started making videos, and kuch naya aane wala h.

[@anishbishnoi29xD]

Mene bhi DSA band kr dia Tha Apne video dalni band ki thi tabse bhai. Ab wapis continue kr raha hu.

[@ayanthisside]

Help a lot

[@udyanishere]

Means a lot thank you for being here

[@novicecoder5753]

Your approach is good but initially got below approach in my mind and implemented but after watching your solution it good
class Solution {
public static boolean checkToeplitz(int i, int j,int[][] matrix){
while(i < matrix.length && j < matrix[0].length){
if(matrix[i][j] != matrix[i-1][j-1]){
return false;
}
i++;
j++;
}
return true;
}
public boolean isToeplitzMatrix(int[][] matrix) {
int n = matrix.length;
int m = matrix[0].length;

//My approach is first check the first row whether it is diagonally perfect then check first column whether it is diagonally perfect.


//row checking
int currentRow = 0;
for(int i=0;i

[@videokingdom6076]

this code is not working bro 😢😢

[@udyanishere]

Sad. Let me look into it

[@meghanajeereddy5149]

add the additional condition in "if" block as i>=0 and j>=0