2 files changed, 27 insertions, 0 deletions
diff --git a/challenge-244/eric-cheung/python/ch-1.py b/challenge-244/eric-cheung/python/ch-1.py
new file mode 100755
index 0000000000..0689b32341
--- /dev/null
+++ b/challenge-244/eric-cheung/python/ch-1.py
@@ -0,0 +1,8 @@
+
+## arrNum = [8, 1, 2, 2, 3]  ## Example 1
+## arrNum = [6, 5, 4, 8]  ## Example 2
+arrNum = [2, 2, 2]  ## Example 3
+
+arrOutput = [sum(nLoop < nNumLoop for nLoop in arrNum) for nNumLoop in arrNum]
+
+print (arrOutput)
diff --git a/challenge-244/eric-cheung/python/ch-2.py b/challenge-244/eric-cheung/python/ch-2.py
new file mode 100755
index 0000000000..637dcacca2
--- /dev/null
+++ b/challenge-244/eric-cheung/python/ch-2.py
@@ -0,0 +1,19 @@
+
+## Ref.
+## https://stackoverflow.com/questions/1482308/how-to-get-all-subsets-of-a-set-powerset
+
+from itertools import chain, combinations
+
+def GetPowerSet(arrInput):
+    return list(chain.from_iterable(combinations(arrInput, rLoop) for rLoop in range(1, len(arrInput) + 1)))
+
+arrNum = [2, 1, 4]  ## Example 1
+
+nSum = 0
+
+for arrLoop in GetPowerSet(arrNum):
+    nMax = max(arrLoop)
+    nMin = min(arrLoop)
+    nSum = nSum + nMax * nMax * nMin
+
+print (nSum)