sgreen solutions to challenge 336

1 files changed, 30 insertions, 0 deletions

diff --git a/challenge-336/sgreen/python/ch-1.py b/challenge-336/sgreen/python/ch-1.py
new file mode 100755
index 0000000000..d6bd5aa0df
--- /dev/null
+++ b/challenge-336/sgreen/python/ch-1.py
@@ -0,0 +1,30 @@
+#!/usr/bin/env python3
+
+import sys
+from collections import Counter
+
+def equal_group(ints: list) -> bool:
+    # Calculate the frequency of each integer in the list
+    freq = Counter(ints).values()
+
+    # If any integer appears only once, it is always false.
+    if min(freq) == 1:
+        return False
+
+    # Check if all frequencies are evenly divisible by an integer.
+    for i in range(2, max(freq) + 1):
+        if all(f % i == 0 for f in freq):
+            return True
+
+    return False
+
+
+def main():
+    # Convert input into integers
+    array = [int(n) for n in sys.argv[1:]]
+    result = equal_group(array)
+    print(result)
+
+
+if __name__ == '__main__':
+    main()