python solutions to challenge 81

2 files changed, 42 insertions, 0 deletions

diff --git a/challenge-081/walt-mankowski/python/ch-1.py b/challenge-081/walt-mankowski/python/ch-1.py
new file mode 100644
index 0000000000..a268b371f5
--- /dev/null
+++ b/challenge-081/walt-mankowski/python/ch-1.py
@@ -0,0 +1,13 @@
+from sys import argv
+
+def is_base(prefix, s):
+    cnt = int(len(s) / len(prefix))
+    return prefix * cnt == s
+
+a, b = argv[1:]
+max_base_len = min(len(a), len(b))
+
+for i in range(1, max_base_len+1):
+    prefix = a[0:i]
+    if is_base(prefix, a) and is_base(prefix, b):
+        print(prefix)
diff --git a/challenge-081/walt-mankowski/python/ch-2.py b/challenge-081/walt-mankowski/python/ch-2.py
new file mode 100644
index 0000000000..2b6c400b45
--- /dev/null
+++ b/challenge-081/walt-mankowski/python/ch-2.py
@@ -0,0 +1,29 @@
+from sys import argv
+from collections import defaultdict
+import re
+
+d = defaultdict(int)
+fname = argv[1]
+with open(fname) as f:
+    for line in f:
+        line = line.rstrip()
+        line = re.sub('--', ' ', line)
+        if line == '':
+            continue
+        toks = line.split(' ')
+        for tok in toks:
+            tok = re.sub('[."(),]', '', tok);
+            tok = re.sub("'s$", '', tok)
+            d[tok] += 1
+
+last = 0
+for k in sorted(d, key=lambda k:(d[k], k)):
+    if d[k] != last:
+        if last != 0:
+            print()
+        print(d[k], end='')
+        last = d[k]
+    print(f" {k}", end = '')
+
+print()
+