aboutsummaryrefslogtreecommitdiff
path: root/challenge-211/spadacciniweb/python
diff options
context:
space:
mode:
authorMohammad S Anwar <Mohammad.Anwar@yahoo.com>2023-04-09 11:26:44 +0100
committerGitHub <noreply@github.com>2023-04-09 11:26:44 +0100
commitca92a7e5192784f412184ed5b32c978313739eeb (patch)
tree8fc8992bde4d6020f3334c6fa4c1ddae3e03772d /challenge-211/spadacciniweb/python
parentfddb9f40bd8b9a54b85c95f25370a545aada83fc (diff)
parentd4bacf05e9f6837997f06554a1c6a971d42ae6ad (diff)
downloadperlweeklychallenge-club-ca92a7e5192784f412184ed5b32c978313739eeb.tar.gz
perlweeklychallenge-club-ca92a7e5192784f412184ed5b32c978313739eeb.tar.bz2
perlweeklychallenge-club-ca92a7e5192784f412184ed5b32c978313739eeb.zip
Merge pull request #7863 from spadacciniweb/PWC-211
PWC 211
Diffstat (limited to 'challenge-211/spadacciniweb/python')
-rw-r--r--challenge-211/spadacciniweb/python/ch-1.py43
1 files changed, 43 insertions, 0 deletions
diff --git a/challenge-211/spadacciniweb/python/ch-1.py b/challenge-211/spadacciniweb/python/ch-1.py
new file mode 100644
index 0000000000..00f663b9f1
--- /dev/null
+++ b/challenge-211/spadacciniweb/python/ch-1.py
@@ -0,0 +1,43 @@
+# Task 1: Toeplitz Matrix
+# Submitted by: Mohammad S Anwar
+#
+# You are given a matrix m x n.
+# Write a script to find out if the given matrix is Toeplitz Matrix.
+# A matrix is Toeplitz if every diagonal from top-left to bottom-right has the same elements.
+#
+#
+# Example 1
+# Input: @matrix = [ [4, 3, 2, 1],
+# [5, 4, 3, 2],
+# [6, 5, 4, 3],
+# ]
+# Output: true
+#
+# Example 2
+# Input: @matrix = [ [1, 2, 3],
+# [3, 2, 1],
+# ]
+# Output: false
+
+import numpy
+
+def check_toeplitz(matrix):
+ m = numpy.array(matrix)
+ dim = min(m.shape)
+ value = m[0][0]
+ for i in range(dim):
+ if m[i][i] != value:
+ return 'false'
+ return 'true'
+
+if __name__ == "__main__":
+ matrix = [ [4, 3, 2, 1],
+ [5, 4, 3, 2],
+ [6, 5, 4, 3],
+ ]
+ print(check_toeplitz(matrix))
+
+ matrix = [ [1, 2, 3],
+ [3, 2, 1],
+ ]
+ print(check_toeplitz(matrix))