1 files changed, 55 insertions, 0 deletions
diff --git a/challenge-070/paulo-custodio/python/ch-1.py b/challenge-070/paulo-custodio/python/ch-1.py
new file mode 100644
index 0000000000..2c3ee74ebb
--- /dev/null
+++ b/challenge-070/paulo-custodio/python/ch-1.py
@@ -0,0 +1,55 @@
+#!/usr/bin/env python3
+
+# Challenge 070
+#
+# TASK #1 > Character Swapping
+# Submitted by: Mohammad S Anwar
+# You are given a string $S of size $N.
+#
+# You are also given swap count $C and offset $O such that
+# $C >= 1, $O >= 1, $C <= $O and $C + $O <= $N.
+#
+#
+# UPDATE: 2020-07-20 16:10:00
+# Pete Houston suggested to put additional constraint i.e. $C <= $O.
+# He presented the use case $S = 'abcd', $C = 2, $O = 1.
+#
+# Write a script to perform character swapping like below:
+#
+# $S[ 1 % $N ] <=> $S[ (1 + $O) % $N ]
+# $S[ 2 % $N ] <=> $S[ (2 + $O) % $N ]
+# $S[ 3 % $N ] <=> $S[ (3 + $O) % $N ]
+# ...
+# ...
+# $S[ $C % $N ] <=> $S[ ($C + $O) % $N ]
+# Example 1
+# Input:
+#     $S = 'perlandraku'
+#     $C = 3
+#     $O = 4
+#
+# Character Swapping:
+#     swap 1: e <=> n = pnrlaedraku
+#     swap 2: r <=> d = pndlaerraku
+#     swap 3: l <=> r = pndraerlaku
+#
+# Output:
+#     pndraerlaku
+
+import sys
+
+def swap(s, c, o):
+    def swap1(s, c, o):
+        s_list = list(s)
+        p1 = c % len(s_list)
+        p2 = (c + o) % len(s_list)
+        s_list[p1], s_list[p2] = s_list[p2], s_list[p1]
+        return ''.join(s_list)
+
+    for _ in range(1, c+1):
+        s = swap1(s, _, o)
+    return s
+
+
+S, C, O = sys.argv[1], int(sys.argv[2]), int(sys.argv[3])
+print(swap(S, C, O))