Merge pull request #9778 from spadacciniweb/PWC-261

Add ch-1 and ch-2 in Perl, Elixir, Go, Python, Ruby

2 files changed, 119 insertions, 0 deletions

diff --git a/challenge-261/spadacciniweb/python/ch-1.py b/challenge-261/spadacciniweb/python/ch-1.py
new file mode 100644
index 0000000000..316c595a5e
--- /dev/null
+++ b/challenge-261/spadacciniweb/python/ch-1.py
@@ -0,0 +1,58 @@
+# Task 1: Element Digit Sum
+# Submitted by: Mohammad Sajid Anwar
+# 
+# You are given an array of integers, @ints.
+# Write a script to evaluate the absolute difference between element and digit sum of the given array.
+# 
+# Example 1
+# Input: @ints = (1,2,3,45)
+# Output: 36
+# 
+# Element Sum: 1 + 2 + 3 + 45 = 51
+# Digit Sum: 1 + 2 + 3 + 4 + 5 = 15
+# Absolute Difference: | 51 - 15 | = 36
+# 
+# Example 2
+# Input: @ints = (1,12,3)
+# Output: 9
+# 
+# Element Sum: 1 + 12 + 3 = 16
+# Digit Sum: 1 + 1 + 2 + 3 = 7
+# Absolute Difference: | 16 - 7 | = 9
+# 
+# Example 3
+# Input: @ints = (1,2,3,4)
+# Output: 0
+# 
+# Element Sum: 1 + 2 + 3 + 4 = 10
+# Digit Sum: 1 + 2 + 3 + 4 = 10
+# Absolute Difference: | 10 - 10 | = 0
+# 
+# Example 4
+# Input: @ints = (236, 416, 336, 350)
+# Output: 1296
+
+def absolute_difference(ints):
+    sum_ints = sum(ints)
+
+    sum_digits = 0
+    for n in ints:
+        sum_digits += sum( int(i) for i in str(n) )
+    print("(%s) -> %d" % 
+             ( ",".join(map(str, ints)), 
+               abs(sum_ints - sum_digits)
+             )
+    )
+
+if __name__ == "__main__":
+    ints = [1,2,3,45]
+    absolute_difference(ints)
+
+    ints = [1,12,3]
+    absolute_difference(ints)
+
+    ints = [1,2,3,4]
+    absolute_difference(ints)
+
+    ints = [236, 416, 336, 350]
+    absolute_difference(ints)
diff --git a/challenge-261/spadacciniweb/python/ch-2.py b/challenge-261/spadacciniweb/python/ch-2.py
new file mode 100644
index 0000000000..ff17b0fa2b
--- /dev/null
+++ b/challenge-261/spadacciniweb/python/ch-2.py
@@ -0,0 +1,61 @@
+# Task 2: Multiply by Two
+# Submitted by: Mohammad Sajid Anwar
+# 
+# You are given an array of integers, @ints and an integer $start..
+# Write a script to do the followings:
+# 
+# a) Look for $start in the array @ints, if found multiply the number by 2
+# b) If not found stop the process otherwise repeat
+# 
+# In the end return the final value.
+# 
+# Example 1
+# Input: @ints = (5,3,6,1,12) and $start = 3
+# Output: 24
+# 
+# Step 1: 3 is in the array so 3 x 2 = 6
+# Step 2: 6 is in the array so 6 x 2 = 12
+# Step 3: 12 is in the array so 12 x 2 = 24
+# 
+# 24 is not found in the array so return 24.
+# 
+# Example 2
+# Input: @ints = (1,2,4,3) and $start = 1
+# Output: 8
+# 
+# Step 1: 1 is in the array so 1 x 2 = 2
+# Step 2: 2 is in the array so 2 x 2 = 4
+# Step 3: 4 is in the array so 4 x 2 = 8
+# 
+# 8 is not found in the array so return 8.
+# 
+# Example 3
+# Input: @ints = (5,6,7) and $start = 2
+# Output: 2
+# 
+# 2 is not found in the array so return 2.
+
+def multiply_by_two(start, ints):
+    curr = start
+    while (curr in ints):
+        curr *= 2
+
+    print("start %s (%s) -> %d" % 
+             ( start,
+               ",".join(map(str, ints)), 
+               curr
+             )
+    )
+
+if __name__ == "__main__":
+    ints = [5,3,6,1,12]
+    start = 3
+    multiply_by_two(start, ints);
+
+    ints = [1,2,4,3]
+    start = 1
+    multiply_by_two(start, ints);
+
+    ints = [5,6,7]
+    start= 2
+    multiply_by_two(start, ints);