pwc260 solution in python

2 files changed, 124 insertions, 0 deletions

diff --git a/challenge-260/pokgopun/python/ch-1.py b/challenge-260/pokgopun/python/ch-1.py
new file mode 100644
index 0000000000..734382ae7c
--- /dev/null
+++ b/challenge-260/pokgopun/python/ch-1.py
@@ -0,0 +1,56 @@
+### https://theweeklychallenge.org/blog/perl-weekly-challenge-260/
+"""
+
+Task 1: Unique Occurrences
+
+Submitted by: [42]Mohammad Sajid Anwar
+     __________________________________________________________________
+
+   You are given an array of integers, @ints.
+
+   Write a script to return 1 if the number of occurrences of each value
+   in the given array is unique or 0 otherwise.
+
+Example 1
+
+Input: @ints = (1,2,2,1,1,3)
+Output: 1
+
+The number 1 occurred 3 times.
+The number 2 occurred 2 times.
+The number 3 occurred 1 time.
+
+All occurrences are unique, therefore the output is 1.
+
+Example 2
+
+Input: @ints = (1,2,3)
+Output: 0
+
+Example 3
+
+Input: @ints = (-2,0,1,-2,1,1,0,1,-2,9)
+Output: 1
+
+Task 2: Dictionary Rank
+"""
+### solution by pokgopun@gmail.com
+
+def UO(tup: tuple):
+    s = set(tup)
+    return len(s)==len(set(tup.count(e) for e in s))
+
+import unittest
+
+class TestUO(unittest.TestCase):
+    def test(self):
+        for inpt, otpt in {
+                (1,2,2,1,1,3): 1,
+                (1,2,3): 0,
+                (-2,0,1,-2,1,1,0,1,-2,9): 1,
+                }.items():
+            self.assertEqual(UO(inpt),otpt)
+
+unittest.main()
+
+
diff --git a/challenge-260/pokgopun/python/ch-2.py b/challenge-260/pokgopun/python/ch-2.py
new file mode 100644
index 0000000000..6925831197
--- /dev/null
+++ b/challenge-260/pokgopun/python/ch-2.py
@@ -0,0 +1,68 @@
+### https://theweeklychallenge.org/blog/perl-weekly-challenge-260/
+"""
+
+Task 2: Dictionary Rank
+
+Submitted by: [43]Mark Anderson
+     __________________________________________________________________
+
+   You are given a word, $word.
+
+   Write a script to compute the dictionary rank of the given word.
+
+Example 1
+
+Input: $word = 'CAT'
+Output: 3
+
+All possible combinations of the letters:
+CAT, CTA, ATC, TCA, ACT, TAC
+
+Arrange them in alphabetical order:
+ACT, ATC, CAT, CTA, TAC, TCA
+
+CAT is the 3rd in the list.
+Therefore the dictionary rank of CAT is 3.
+
+Example 2
+
+Input: $word = 'GOOGLE'
+Output: 88
+
+Example 3
+
+Input: $word = 'SECRET'
+Output: 255
+     __________________________________________________________________
+
+   Last date to submit the solution 23:59 (UK Time) Sunday 17th March
+   2024.
+     __________________________________________________________________
+
+SO WHAT DO YOU THINK ?
+"""
+### solution by pokgopun@gmail.com
+
+from itertools import permutations
+
+def DC(word: str):
+    return tuple(
+            sorted(
+                set(
+                    permutations(word,len(word))
+                    )
+                )
+            ).index(tuple(word)) + 1
+
+import unittest
+
+class TestDC(unittest.TestCase):
+    def test(self):
+        for inpt, otpt in {
+                'CAT': 3,
+                'GOOGLE': 88,
+                'SECRET': 255,
+                }.items():
+            self.assertEqual(DC(inpt),otpt)
+
+unittest.main()