sgreen solutions to challenge 284

3 files changed, 88 insertions, 0 deletions

diff --git a/challenge-284/sgreen/python/ch-1.py b/challenge-284/sgreen/python/ch-1.py
new file mode 100755
index 0000000000..2b7d01598f
--- /dev/null
+++ b/challenge-284/sgreen/python/ch-1.py
@@ -0,0 +1,29 @@
+#!/usr/bin/env python3
+
+from collections import Counter
+import sys
+
+
+def lucky_integer(ints: list) -> str:
+    # Calculate the frequency of each integer
+    freq = Counter(ints)
+
+    # Work through the dict, highest first
+    for i in sorted(freq, reverse=True):
+        if i == freq[i]:
+            # We have the lucky integer
+            return i
+
+    # There is no lucky integer
+    return -1
+
+
+def main():
+    # Convert input into integers
+    array = [int(n) for n in sys.argv[1:]]
+    result = lucky_integer(array)
+    print(result)
+
+
+if __name__ == '__main__':
+    main()
diff --git a/challenge-284/sgreen/python/ch-2.py b/challenge-284/sgreen/python/ch-2.py
new file mode 100755
index 0000000000..a236c11600
--- /dev/null
+++ b/challenge-284/sgreen/python/ch-2.py
@@ -0,0 +1,28 @@
+#!/usr/bin/env python3
+
+import json
+import sys
+
+
+def find_index(lst: list, val: int):
+    # Find the position of val in lst. If it does not appear, return the
+    #  length of the list
+    return lst.index(val) if val in lst else len(lst)
+
+
+def relative_sort(list1: list, list2: list) -> list:
+    # Sort the first list, in the order they appear in the second list. If
+    # it doesn't appear in the second list, append to the end in numerical order.
+    return sorted(list1, key=lambda i: (find_index(list2, i), i))
+
+
+def main():
+    lists = json.loads(sys.argv[1])
+    result = relative_sort(*lists)
+
+    # Convert to a tuple to match expected output
+    print(tuple(result))
+
+
+if __name__ == '__main__':
+    main()
diff --git a/challenge-284/sgreen/python/test.py b/challenge-284/sgreen/python/test.py
new file mode 100755
index 0000000000..8601576245
--- /dev/null
+++ b/challenge-284/sgreen/python/test.py
@@ -0,0 +1,31 @@
+#!/usr/bin/env python3
+
+import unittest
+ch_1 = __import__('ch-1')
+ch_2 = __import__('ch-2')
+
+
+class TestClass(unittest.TestCase):
+    def test_ch_1(self):
+        self.assertEqual(ch_1.lucky_integer([2, 2, 3, 4]), 2)
+        self.assertEqual(ch_1.lucky_integer([1, 2, 2, 3, 3, 3]), 3)
+        self.assertEqual(ch_1.lucky_integer([1, 1, 1, 3]), -1)
+
+    def test_ch_2(self):
+        self.assertEqual(
+            ch_2.relative_sort([2, 3, 9, 3, 1, 4, 6, 7, 2, 8, 5],
+                               [2, 1, 4, 3, 5, 6]),
+            [2, 2, 1, 4, 3, 3, 5, 6, 7, 8, 9]
+        )
+        self.assertEqual(
+            ch_2.relative_sort([3, 3, 4, 6, 2, 4, 2, 1, 3], [1, 3, 2]),
+            [1, 3, 3, 3, 2, 2, 4, 4, 6]
+        )
+        self.assertEqual(
+            ch_2.relative_sort([3, 0, 5, 0, 2, 1, 4, 1, 1], [1, 0, 3, 2]),
+            [1, 1, 1, 0, 0, 3, 2, 4, 5]
+        )
+
+
+if __name__ == '__main__':
+    unittest.main()