From 6efda219c95b36111a3be91d0b7908f0f7e7bd55 Mon Sep 17 00:00:00 2001
From: Paulo Custodio <pauloscustodio@gmail.com>
Date: Fri, 20 Sep 2024 09:30:28 +0100
Subject: Add Python solution to challenge 068

---
 challenge-068/paulo-custodio/python/ch-1.py | 56 +++++++++++++++++++++++++++++
 1 file changed, 56 insertions(+)
 create mode 100644 challenge-068/paulo-custodio/python/ch-1.py

(limited to 'challenge-068/paulo-custodio/python/ch-1.py')

diff --git a/challenge-068/paulo-custodio/python/ch-1.py b/challenge-068/paulo-custodio/python/ch-1.py
new file mode 100644
index 0000000000..6171b18125
--- /dev/null
+++ b/challenge-068/paulo-custodio/python/ch-1.py
@@ -0,0 +1,56 @@
+#!/usr/bin/env python3
+
+# Challenge 068
+#
+# TASK #1 > Zero Matrix
+# Submitted by: Mohammad S Anwar
+# You are given a matrix of size M x N having only 0s and 1s.
+#
+# Write a script to set the entire row and column to 0 if an element is 0.
+#
+# Example 1
+# Input: [1, 0, 1]
+#        [1, 1, 1]
+#        [1, 1, 1]
+#
+# Output: [0, 0, 0]
+#         [1, 0, 1]
+#         [1, 0, 1]
+# Example 2
+# Input: [1, 0, 1]
+#        [1, 1, 1]
+#        [1, 0, 1]
+#
+# Output: [0, 0, 0]
+#         [1, 0, 1]
+#         [0, 0, 0]
+
+from copy import deepcopy
+import unittest
+
+def zero_matrix(m):
+    orig = deepcopy(m)
+    for r in range(len(m)):
+        for c in range(len(m[0])):
+            if not orig[r][c]:
+                m = zero_row(r, m)
+                m = zero_col(c, m)
+    return m
+
+def zero_row(r, m):
+    for c in range(len(m[0])):
+        m[r][c] = 0
+    return m
+
+def zero_col(c, m):
+    for r in range(len(m)):
+        m[r][c] = 0
+    return m
+
+class TestZeroMatrix(unittest.TestCase):
+    def test_zero_matrix(self):
+        self.assertEqual(zero_matrix([[1, 0, 1], [1, 1, 1], [1, 1, 1]]), [[0, 0, 0], [1, 0, 1], [1, 0, 1]])
+        self.assertEqual(zero_matrix([[1, 0, 1], [1, 1, 1], [1, 0, 1]]), [[0, 0, 0], [1, 0, 1], [0, 0, 0]])
+
+if __name__ == '__main__':
+    unittest.main()
-- 
cgit