Merge pull request #7299 from simongreen-net/master

Simon's solution to challenge 195 and 196

1 files changed, 29 insertions, 0 deletions

diff --git a/challenge-195/sgreen/python/ch-2.py b/challenge-195/sgreen/python/ch-2.py
new file mode 100755
index 0000000000..0ba621b63f
--- /dev/null
+++ b/challenge-195/sgreen/python/ch-2.py
@@ -0,0 +1,29 @@
+#!/usr/bin/env python3
+
+import sys
+
+
+def main(array):
+    # Count the frequency of even numbers
+    evens = {}
+    for i in array:
+        if i % 2 == 0:
+            evens[i] = evens.get(i, 0) + 1
+
+    if not evens:
+        # If no evens, return -1
+        print(-1)
+    else:
+        # Find the evens that occur most often
+        m = max(evens.values())
+        max_evens = [i for i, v in evens.items() if v == m]
+
+        # The the minimum even that occurs most often
+        min_max_evens = min(max_evens)
+        print(min_max_evens)
+
+
+if __name__ == '__main__':
+    # Turn the strings into integers
+    n = [int(i) for i in sys.argv[1:]]
+    main(n)