Add solution #766

Author: JoshCrozier

0766-toeplitz-matrix.js

@@ -0,0 +1,28 @@
+/**
+ * 766. Toeplitz Matrix
+ * https://leetcode.com/problems/toeplitz-matrix/
+ * Difficulty: Easy
+ *
+ * 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.
+ */
+
+/**
+ * @param {number[][]} matrix
+ * @return {boolean}
+ */
+function isToeplitzMatrix(matrix) {
+  const rows = matrix.length;
+  const cols = matrix[0].length;
+
+  for (let r = 0; r < rows - 1; r++) {
+    for (let c = 0; c < cols - 1; c++) {
+      if (matrix[r][c] !== matrix[r + 1][c + 1]) {
+        return false;
+      }
+    }
+  }
+
+  return true;
+}

README.md

@@ -580,6 +580,7 @@
 763|[Partition Labels](./0763-partition-labels.js)|Medium|
 764|[Largest Plus Sign](./0764-largest-plus-sign.js)|Medium|
 765|[Couples Holding Hands](./0765-couples-holding-hands.js)|Hard|
+766|[Toeplitz Matrix](./0766-toeplitz-matrix.js)|Easy|
 783|[Minimum Distance Between BST Nodes](./0783-minimum-distance-between-bst-nodes.js)|Easy|
 784|[Letter Case Permutation](./0784-letter-case-permutation.js)|Medium|
 790|[Domino and Tromino Tiling](./0790-domino-and-tromino-tiling.js)|Medium|