From 08876ee53bdcdad26d70f99bb6070de2f8976cd1 Mon Sep 17 00:00:00 2001
From: Mohammad Sajid Anwar <mohammad.anwar@yahoo.com>
Date: Tue, 10 Sep 2024 09:06:43 +0100
Subject: - Added solutions by Eric Cheung.

---
 challenge-286/eric-cheung/python/ch-1.py | 18 ++++++++++++++++++
 challenge-286/eric-cheung/python/ch-2.py | 15 +++++++++++++++
 2 files changed, 33 insertions(+)
 create mode 100755 challenge-286/eric-cheung/python/ch-1.py
 create mode 100755 challenge-286/eric-cheung/python/ch-2.py

(limited to 'challenge-286/eric-cheung/python')

diff --git a/challenge-286/eric-cheung/python/ch-1.py b/challenge-286/eric-cheung/python/ch-1.py
new file mode 100755
index 0000000000..c8083edb23
--- /dev/null
+++ b/challenge-286/eric-cheung/python/ch-1.py
@@ -0,0 +1,18 @@
+
+import sys
+import random
+
+objFile = open(sys.argv[0], "r")
+
+arrContent = objFile.readlines()
+
+arrOutput = []
+for strLoop in arrContent:
+    strLoop = strLoop.replace("\n", "")
+    if not strLoop:
+        continue
+    arrOutput = arrOutput + strLoop.split(" ")
+
+## print (arrOutput)
+
+print (arrOutput[random.randrange(len(arrOutput))])
diff --git a/challenge-286/eric-cheung/python/ch-2.py b/challenge-286/eric-cheung/python/ch-2.py
new file mode 100755
index 0000000000..16b6e9bfa6
--- /dev/null
+++ b/challenge-286/eric-cheung/python/ch-2.py
@@ -0,0 +1,15 @@
+
+def GetNumMinMax (arrGiven, bIsMax = True):
+    return sorted(arrGiven, reverse = bIsMax)[0]
+
+def GetLastElem (arrInput):
+    if len(arrInput) == 2:
+        return GetNumMinMax(arrInput, False)
+
+    return GetLastElem ([GetNumMinMax(arrInput[nLoop * 2: (nLoop + 1) * 2], nLoop % 2 == 1) for nLoop in range(0, int(len(arrInput) / 2))])
+
+## arrInts = [2, 1, 4, 5, 6, 3, 0, 2]  ## Example 1
+## arrInts = [0, 5, 3, 2]  ## Example 2
+arrInts = [9, 2, 1, 4, 5, 6, 0, 7, 3, 1, 3, 5, 7, 9, 0, 8]  ## Example 3
+
+print (GetLastElem (arrInts))
-- 
cgit