solves toepitz matrix

Author: anishLearnsToCode

README.md

@@ -1,8 +1,8 @@
 # LeetCode Algorithms
 
-![problems-solved](https://img.shields.io/badge/Problems%20Solved-183/2081-1f425f.svg)
-![problems-solved-java](https://img.shields.io/badge/Java-183/2081-1abc9c.svg)
-![problems-solved-python](https://img.shields.io/badge/Python-183/2081-1abc9c.svg)
+![problems-solved](https://img.shields.io/badge/Problems%20Solved-185/2081-1f425f.svg)
+![problems-solved-java](https://img.shields.io/badge/Java-185/2081-1abc9c.svg)
+![problems-solved-python](https://img.shields.io/badge/Python-185/2081-1abc9c.svg)
 [![PRs Welcome](https://img.shields.io/badge/PRs-welcome-brightgreen.svg)](CONTRIBUTING.md)
 [![cp](https://img.shields.io/badge/also%20see-Competitve%20Programming-1f72ff.svg)](https://github.com/anishLearnsToCode/competitive-programming)
 
@@ -210,7 +210,7 @@
 | 758 | [Bold Words in String](https://leetcode.com/problems/bold-words-in-string) | |
 | 760 | [Find Anagram Mappings](https://leetcode.com/problems/find-anagram-mappings) | |
 | 762 | [Prime Number of Set Bits in Primary Representation](https://leetcode.com/problems/prime-number-of-set-bits-in-binary-representation) | [![Java](assets/java.png)](src/PrimeNumberOfSetBitsInBinaryRepresentation.java) [![Python](assets/python.png)](python/prime_number_of_set_bits_in_binary_representation.py) |
-| 766 | [Toeplitz Matrix](https://leetcode.com/problems/toeplitz-matrix) | |
+| 766 | [Toeplitz Matrix](https://leetcode.com/problems/toeplitz-matrix) | [![Java](assets/java.png)](src/ToeplitzMatrix.java) [![Python](assets/python.png)](python/toeplitz_matrix.py) |
 | 771 | [Jewels and Stones](https://leetcode.com/problems/jewels-and-stones) | |
 | 783 | [Minimum Distance Between BST Nodes](https://leetcode.com/problems/minimum-distance-between-bst-nodes) | [![Java](assets/java.png)](src/MinimumAbsoluteDifferenceInBST.java) [![Python](assets/python.png)](python/minimum_distance_between_bst_nodes.py) |
 | 788 | [Rotated Digits](https://leetcode.com/problems/rotated-digits) | |

python/toeplitz_matrix.py

@@ -0,0 +1,21 @@
+from typing import List
+
+
+class Solution:
+    def isToeplitzMatrix(self, matrix: List[List[int]]) -> bool:
+        columns, rows = len(matrix[0]), len(matrix)
+        for column in range(columns - 1):
+            current = matrix[0][column]
+            for row in range(1, rows):
+                if column + row >= columns:
+                    break
+                if matrix[row][column + row] != current:
+                    return False
+        for row in range(1, rows - 1):
+            current = matrix[row][0]
+            for column in range(1, columns):
+                if row + column >= rows:
+                    break
+                if matrix[row + column][column] != current:
+                    return False
+        return True

src/ToeplitzMatrix.java

@@ -0,0 +1,19 @@
+public class ToeplitzMatrix {
+    public boolean isToeplitzMatrix(int[][] matrix) {
+        final int rows = matrix.length, columns = matrix[0].length;
+        int current;
+        for (int column = 0 ; column < columns ; column++) {
+            current = matrix[0][column];
+            for (int row = 1 ; row < rows && column + row < columns ; row++) {
+                if (matrix[row][column + row] != current) return false;
+            }
+        }
+        for (int row = 1 ; row < rows - 1 ; row++) {
+            current = matrix[row][0];
+            for (int column = 1 ; column < columns && row + column < rows ; column++) {
+                if (matrix[row + column][column] != current) return false;
+            }
+        }
+        return true;
+    }
+}