TOEPLITZ MATRIX | LEETCODE # 766 | PYTHON SOLUTION

[@MattK-ez5ti]

could you please explain how to do the follow up questions?

[@pavananand7327]

Did you get the answer to this?

[@Ankit-hs9nb]

I tried this:
class Solution:
def isToeplitzMatrix(self, matrix: List[List[int]]) -> bool:


for row in range(len(matrix)-1):
for col in range(len(matrix[0])-1):
if matrix[row][col] != matrix[row+1][col+1]:
return False
return True

[@yehsunkang5150]

Great insight! Simple and readable..

[@OmarAhmed-nb4mv]

God bless you ❤️🙏

[@SatinderSingh71]

The solution tab shows a much more concise solution where we just iterate thru the entire grid all at once (4 lines of code).

[@pieter5466]

Noticed also. However, this uses a highly generalizable pattern in case you don't quickly see that "trick" (repeatedly traversing a section of a data structure.)

[@sanooosai]

thank you sir

[@johnsonnguyen9605]

I appreciate you :)

[@khoaanh7375]

nice

[@crackfaang]

No problem, thanks for watching