pwc338 solution in python

2 files changed, 289 insertions, 0 deletions

diff --git a/challenge-338/pokgopun/python/ch-1.py b/challenge-338/pokgopun/python/ch-1.py
new file mode 100644
index 0000000000..4bebb2083e
--- /dev/null
+++ b/challenge-338/pokgopun/python/ch-1.py
@@ -0,0 +1,83 @@
+### https://theweeklychallenge.org/blog/perl-weekly-challenge-338/
+"""
+
+Task 1: Highest Row
+
+Submitted by: [44]Mohammad Sajid Anwar
+     __________________________________________________________________
+
+   You are given a m x n matrix.
+
+   Write a script to find the highest row sum in the given matrix.
+
+Example 1
+
+Input: @matrix = ([4,  4, 4, 4],
+                  [10, 0, 0, 0],
+                  [2,  2, 2, 9])
+Output: 16
+
+Row 1: 4  + 4 + 4 + 4 => 16
+Row 2: 10 + 0 + 0 + 0 => 10
+Row 3: 2  + 2 + 2 + 9 => 15
+
+Example 2
+
+Input: @matrix = ([1, 5],
+                  [7, 3],
+                  [3, 5])
+Output: 10
+
+Example 3
+
+Input: @matrix = ([1, 2, 3],
+                  [3, 2, 1])
+Output: 6
+
+Example 4
+
+Input: @matrix = ([2, 8, 7],
+                  [7, 1, 3],
+                  [1, 9, 5])
+Output: 17
+
+Example 5
+
+Input: @matrix = ([10, 20,  30],
+                  [5,  5,   5],
+                  [0,  100, 0],
+                  [25, 25,  25])
+Output: 100
+
+Task 2: Max Distance
+"""
+### solution by pokgopun@gmail.com
+
+def hr(matrix: tuple[tuple[int]]) -> int:
+    return max(sum(e) for e in matrix)
+
+import unittest
+
+class TestHr(unittest.TestCase):
+    def test(self):
+        for inpt, otpt in {
+                ((4,  4, 4, 4),
+                  (10, 0, 0, 0),
+                  (2,  2, 2, 9)): 16,
+                ((1, 5),
+                  (7, 3),
+                  (3, 5)): 10,
+                ((1, 2, 3),
+                  (3, 2, 1)): 6,
+                ((2, 8, 7),
+                  (7, 1, 3),
+                  (1, 9, 5)): 17,
+                ((10, 20,  30),
+                  (5,  5,   5),
+                  (0,  100, 0),
+                  (25, 25,  25)): 100,
+                }.items():
+            self.assertEqual(hr(inpt),otpt)
+
+unittest.main()
+
diff --git a/challenge-338/pokgopun/python/ch-2.py b/challenge-338/pokgopun/python/ch-2.py
new file mode 100644
index 0000000000..f33632ff42
--- /dev/null
+++ b/challenge-338/pokgopun/python/ch-2.py
@@ -0,0 +1,206 @@
+### https://theweeklychallenge.org/blog/perl-weekly-challenge-338/
+"""
+
+Task 2: Max Distance
+
+Submitted by: [45]Mohammad Sajid Anwar
+     __________________________________________________________________
+
+   You are given two integer arrays, @arr1 and @arr2.
+
+   Write a script to find the maximum difference between any pair of
+   values from both arrays.
+
+Example 1
+
+Input: @arr1 = (4, 5, 7)
+       @arr2 = (9, 1, 3, 4)
+Output: 6
+
+With element $arr1[0] = 4
+| 4 - 9 | = 5
+| 4 - 1 | = 3
+| 4 - 3 | = 1
+| 4 - 4 | = 0
+max distance = 5
+
+With element $arr1[1] = 5
+| 5 - 9 | = 4
+| 5 - 1 | = 4
+| 5 - 3 | = 2
+| 5 - 4 | = 1
+max distance = 4
+
+With element $arr1[2] = 7
+| 7 - 9 | = 2
+| 7 - 1 | = 6
+| 7 - 3 | = 4
+| 7 - 4 | = 4
+max distance = 6
+
+max (5, 6, 6) = 6
+
+Example 2
+
+Input: @arr1 = (2, 3, 5, 4)
+       @arr2 = (3, 2, 5, 5, 8, 7)
+Output: 6
+
+With element $arr1[0] = 2
+| 2 - 3 | = 1
+| 2 - 2 | = 0
+| 2 - 5 | = 3
+| 2 - 5 | = 3
+| 2 - 8 | = 6
+| 2 - 7 | = 5
+max distance = 6
+
+With element $arr1[1] = 3
+| 3 - 3 | = 0
+| 3 - 2 | = 1
+| 3 - 5 | = 2
+| 3 - 5 | = 2
+| 3 - 8 | = 5
+| 3 - 7 | = 4
+max distance = 5
+
+With element $arr1[2] = 5
+| 5 - 3 | = 2
+| 5 - 2 | = 3
+| 5 - 5 | = 0
+| 5 - 5 | = 0
+| 5 - 8 | = 3
+| 5 - 7 | = 2
+max distance = 3
+
+With element $arr1[3] = 4
+| 4 - 3 | = 1
+| 4 - 2 | = 2
+| 4 - 5 | = 1
+| 4 - 5 | = 1
+| 4 - 8 | = 4
+| 4 - 7 | = 3
+max distance = 4
+
+max (5, 6, 3, 4) = 6
+
+Example 3
+
+Input: @arr1 = (2, 1, 11, 3)
+       @arr2 = (2, 5, 10, 2)
+Output: 9
+
+With element $arr1[0] = 2
+| 2 - 2  | = 0
+| 2 - 5  | = 3
+| 2 - 10 | = 8
+| 2 - 2  | = 0
+max distance = 8
+
+With element $arr1[1] = 1
+| 1 - 2  | = 1
+| 1 - 5  | = 4
+| 1 - 10 | = 9
+| 1 - 2  | = 1
+max distance = 9
+
+With element $arr1[2] = 11
+| 11 - 2  | = 9
+| 11 - 5  | = 6
+| 11 - 10 | = 1
+| 11 - 2  | = 9
+max distance = 9
+
+With element $arr1[3] = 3
+| 3 - 2  | = 1
+| 3 - 5  | = 2
+| 3 - 10 | = 7
+| 3 - 2  | = 1
+max distance = 7
+
+max (8, 9, 9, 7) = 9
+
+Example 4
+
+Input: @arr1 = (1, 2, 3)
+       @arr2 = (3, 2, 1)
+Output: 2
+
+With element $arr1[0] = 1
+| 1 - 3 | = 2
+| 1 - 2 | = 1
+| 1 - 1 | = 0
+max distance = 2
+
+With element $arr1[1] = 2
+| 2 - 3 | = 1
+| 2 - 2 | = 0
+| 2 - 1 | = 1
+max distance = 1
+
+With element $arr1[2] = 3
+| 3 - 3 | = 0
+| 3 - 2 | = 1
+| 3 - 1 | = 2
+max distance = 2
+
+max (2, 1, 2) = 2
+
+Example 5
+
+Input: @arr1 = (1, 0, 2, 3)
+       @arr2 = (5, 0)
+Output: 5
+
+With element $arr1[0] = 1
+| 1 - 5 | = 4
+| 1 - 0 | = 1
+max distance = 4
+
+With element $arr1[1] = 0
+| 0 - 5 | = 5
+| 0 - 0 | = 0
+max distance = 5
+
+With element $arr1[2] = 2
+| 2 - 5 | = 3
+| 2 - 0 | = 2
+max distance = 3
+
+With element $arr1[3] = 3
+| 3 - 5 | = 2
+| 3 - 0 | = 3
+max distance = 3
+
+max (4, 5, 3, 3) = 5
+     __________________________________________________________________
+
+   Last date to submit the solution 23:59 (UK Time) Sunday 14th September
+   2025.
+     __________________________________________________________________
+
+SO WHAT DO YOU THINK ?
+"""
+### solution by pokgopun@gmail.com
+
+def md(arr1: tuple[int], arr2: tuple[int]) -> int:
+    return max(
+            max(e) for e in (
+                (abs(e1 - e2) for e2 in arr2) for e1 in arr1
+                )
+            )
+
+import unittest
+
+class TestMd(unittest.TestCase):
+    def test(self):
+        for (arr1,arr2), otpt in {
+                ((4, 5, 7), (9, 1, 3, 4)): 6,
+                ((2, 3, 5, 4), (3, 2, 5, 5, 8, 7)): 6,
+                ((2, 1, 11, 3), (2, 5, 10, 2)): 9,
+                ((1, 2, 3), (3, 2, 1)): 2,
+                ((1, 0, 2, 3), (5, 0)): 5,
+                }.items():
+            self.assertEqual(md(arr1,arr2),otpt)
+
+unittest.main()