2 files changed, 34 insertions, 0 deletions
diff --git a/challenge-198/deadmarshal/python/ch1.py b/challenge-198/deadmarshal/python/ch1.py
new file mode 100644
index 0000000000..2eb6f1de5a
--- /dev/null
+++ b/challenge-198/deadmarshal/python/ch1.py
@@ -0,0 +1,14 @@
+def max_gap(arr):
+  if len(arr) < 2: return 0
+  count,temp,mx = 0,0,0
+  arr.sort()
+  for i in range(0,len(arr),2):
+    temp = abs(arr[i] - arr[i+1])
+    if temp > mx: mx = temp
+  for i in range(0,len(arr)-1):
+    if abs(arr[i] - arr[i+1]) == mx: count += 1
+  return count
+    
+print(max_gap([2,5,8,1]))
+print(max_gap([3]))
+
diff --git a/challenge-198/deadmarshal/python/ch2.py b/challenge-198/deadmarshal/python/ch2.py
new file mode 100644
index 0000000000..026ca6275c
--- /dev/null
+++ b/challenge-198/deadmarshal/python/ch2.py
@@ -0,0 +1,20 @@
+def is_prime(n):
+  i = 5
+  if n == 2 or n == 3: return True
+  if n <= 1 or n % 2 == 0 or n % 3 == 0: return False
+  while i * i <= n:
+    if n % i == 0 or n % (i+2) == 0: return false
+    i += 6
+  return True
+
+def prime_count(n):
+  count = 0
+  for i in range(1,n):
+    if is_prime(i): count += 1
+  return count
+
+print(prime_count(10))
+print(prime_count(15))
+print(prime_count(1))
+print(prime_count(25))
+