- Added solutions by Eric Cheung.

- Added solutions by Ulrich Rieke.
- Added solutions by Andrew Shitov.
- Added solutions by Feng Chang.
- Added solutions by PokGoPun.
- Added solutions by Niels van Dijke.
- Added solutions by Simon Proctor.
- Added solutions by Peter Campbell Smith.
- Added solutions by David Ferrone.
- Added solutions by E. Choroba.
- Added solutions by Mark Anderson.
- Added solutions by Andreas Mahnke.
- Added solutions by Ali Moradi.
- Added solutions by Robert Ransbottom.
- Added solutions by Ulrich Reining.

2 files changed, 33 insertions, 0 deletions

diff --git a/challenge-327/eric-cheung/python/ch-1.py b/challenge-327/eric-cheung/python/ch-1.py
new file mode 100755
index 0000000000..6dd6b7b3dc
--- /dev/null
+++ b/challenge-327/eric-cheung/python/ch-1.py
@@ -0,0 +1,8 @@
+

+## arrInts = [1, 2, 1, 3, 2, 5]  ## Example 1

+## arrInts = [1, 1, 1]  ## Example 2

+arrInts = [2, 2, 1]  ## Example 3

+

+arrOutput = [nLoop for nLoop in range(1, len(arrInts) + 1) if not nLoop in arrInts]

+

+print (arrOutput)

diff --git a/challenge-327/eric-cheung/python/ch-2.py b/challenge-327/eric-cheung/python/ch-2.py
new file mode 100755
index 0000000000..4f5c71f173
--- /dev/null
+++ b/challenge-327/eric-cheung/python/ch-2.py
@@ -0,0 +1,25 @@
+

+from itertools import combinations

+

+## arrInts = [4, 1, 2, 3]  ## Example 1

+## arrInts = [1, 3, 7, 11, 15]  ## Example 2

+arrInts = [1, 5, 3, 8]  ## Example 3

+

+arrCombList = combinations(arrInts, 2)

+

+arrOutput = []

+nMinAbsDiff = max(arrInts) - min(arrInts)

+

+for arrLoop in arrCombList:

+    nAbsDiff = abs(arrLoop[0] - arrLoop[1])

+

+    if nAbsDiff > nMinAbsDiff:

+        continue

+

+    if nAbsDiff < nMinAbsDiff:

+        nMinAbsDiff = nAbsDiff

+        arrOutput = []

+

+    arrOutput.append(sorted(list(arrLoop)))

+

+print (sorted(arrOutput))