2 files changed, 123 insertions, 0 deletions
diff --git a/challenge-308/pokgopun/python/ch-1.py b/challenge-308/pokgopun/python/ch-1.py
new file mode 100644
index 0000000000..b68d5e5966
--- /dev/null
+++ b/challenge-308/pokgopun/python/ch-1.py
@@ -0,0 +1,49 @@
+### https://theweeklychallenge.org/blog/perl-weekly-challenge-308/
+"""
+
+Task 1: Count Common
+
+Submitted by: [46]Mohammad Sajid Anwar
+     __________________________________________________________________
+
+   You are given two array of strings, @str1 and @str2.
+
+   Write a script to return the count of common strings in both arrays.
+
+Example 1
+
+Input: @str1 = ("perl", "weekly", "challenge")
+       @str2 = ("raku", "weekly", "challenge")
+Output: 2
+
+Example 2
+
+Input: @str1 = ("perl", "raku", "python")
+       @str2 = ("python", "java")
+Output: 1
+
+Example 3
+
+Input: @str1 = ("guest", "contribution")
+       @str2 = ("fun", "weekly", "challenge")
+Output: 0
+
+Task 2: Decode XOR
+"""
+### solution by pokgopun@gmail.com
+
+def countCommon(strs1: tuple[str], strs2: tuple[str]) -> int:
+    return len( set(strs1) & set(strs2) )
+
+import unittest
+
+class TestCountCommon(unittest.TestCase):
+    def test(self):
+        for (strs1, strs2), otpt in {
+                (("perl", "weekly", "challenge"),("raku", "weekly", "challenge")): 2,
+                (("perl", "raku", "python"),("python", "java")): 1,
+                (("guest", "contribution"),("fun", "weekly", "challenge")): 0,
+                }.items():
+            self.assertEqual(countCommon(strs1,strs2), otpt)
+
+unittest.main()
diff --git a/challenge-308/pokgopun/python/ch-2.py b/challenge-308/pokgopun/python/ch-2.py
new file mode 100644
index 0000000000..5be727177d
--- /dev/null
+++ b/challenge-308/pokgopun/python/ch-2.py
@@ -0,0 +1,74 @@
+### https://theweeklychallenge.org/blog/perl-weekly-challenge-308/
+"""
+
+Task 2: Decode XOR
+
+Submitted by: [47]Mohammad Sajid Anwar
+     __________________________________________________________________
+
+   You are given an encoded array and an initial integer.
+
+   Write a script to find the original array that produced the given
+   encoded array. It was encoded such that encoded[i] = orig[i] XOR orig[i
+   + 1].
+
+Example 1
+
+Input: @encoded = (1, 2, 3), $initial = 1
+Output: (1, 0, 2, 1)
+
+Encoded array created like below, if the original array was (1, 0, 2, 1)
+$encoded[0] = (1 xor 0) = 1
+$encoded[1] = (0 xor 2) = 2
+$encoded[2] = (2 xor 1) = 3
+
+Example 2
+
+Input: @encoded = (6, 2, 7, 3), $initial = 4
+Output: (4, 2, 0, 7, 4)
+     __________________________________________________________________
+
+   Last date to submit the solution 23:59 (UK Time) Sunday 16^th February
+   2025.
+     __________________________________________________________________
+
+SO WHAT DO YOU THINK ?
+"""
+### solution by pokgopun@gmail.com
+
+def decodeXOR(enc: tuple[int], init: int) -> tuple[int]:
+    org = [init]
+    for i in range(len(enc)):
+        o = 0
+        if enc[i] == org[i]: ### a ^ o = a --> o = 0
+            pass
+        elif enc[i] == 0: ### a ^ o = 0 --> o = a
+            o = org[i]
+        elif org[i] == 0: ### 0 ^ o = a --> o = a
+            o = enc[i]
+        else:
+            #print(i)
+            dst, src = enc[i], org[i] 
+            if dst < src:
+                dst, src = src, dst
+            b = 1
+            while dst > 0:
+                o += b * abs(dst%2 - src%2)
+                b *= 2
+                dst //= 2
+                src //= 2
+        org.append(o)
+    return tuple(org)
+
+import unittest
+
+class TestDecodeXOR(unittest.TestCase):
+    def test(self):
+        for (enc, init), otpt in {
+                ((1, 2, 3), 1): (1, 0, 2, 1),
+                ((6, 2, 7, 3), 4): (4, 2, 0, 7, 4),
+                }.items():
+            #print(f'{enc}\n{otpt}')
+            self.assertEqual(decodeXOR(enc, init), otpt)
+ 
+unittest.main()