Merge pull request #10436 from oWnOIzRi/week278

add solutions week 278 in python

2 files changed, 56 insertions, 0 deletions

diff --git a/challenge-278/steven-wilson/python/ch-1.py b/challenge-278/steven-wilson/python/ch-1.py
new file mode 100644
index 0000000000..18b5904a2a
--- /dev/null
+++ b/challenge-278/steven-wilson/python/ch-1.py
@@ -0,0 +1,27 @@
+#!/usr/bin/env python3
+
+import re
+from operator import itemgetter
+
+
+def sort_string(string):
+    """ Given a shuffle string, return the sorted string.  A string is shuffled
+    by appending word position to each word.
+
+    >>> sort_string("and2 Raku3 cousins5 Perl1 are4")
+    'Perl and Raku are cousins'
+    >>> sort_string("guest6 Python1 most4 the3 popular5 is2 language7")
+    'Python is the most popular guest language'
+    >>> sort_string("Challenge3 The1 Weekly2")
+    'The Weekly Challenge'
+    """
+    p = re.compile('^(\w+)(\d+)$')
+    words_numbers = (p.search(word).groups() for word in string.split(" "))
+    words_numbers_sorted = sorted(((w[0], int(w[1])) for w in words_numbers), key=itemgetter(1))
+    return " ".join(word[0] for word in words_numbers_sorted)
+
+
+if __name__ == "__main__":
+    import doctest
+
+    doctest.testmod(verbose=True)
diff --git a/challenge-278/steven-wilson/python/ch-2.py b/challenge-278/steven-wilson/python/ch-2.py
new file mode 100644
index 0000000000..8cec33da3f
--- /dev/null
+++ b/challenge-278/steven-wilson/python/ch-2.py
@@ -0,0 +1,29 @@
+#!/usr/bin/env python3
+
+
+def reverse_word(word, char):
+    """ Given a word and a character, replace the substring up to and including
+    the character with its characters sorted alphabetically. If the character
+    doesn’t exist then DON'T do anything.
+
+    >>> reverse_word("challenge", "e")
+    'acehllnge'
+    >>> reverse_word("programming", "a")
+    'agoprrmming'
+    >>> reverse_word("champion", "b")
+    'champion'
+    >>> reverse_word("champion", "n")
+    'achimnop'
+    """
+    position = word.find(char)
+
+    if position == -1:
+        return word
+
+    return "".join(sorted(word[:position+1])) + word[position+1:]
+
+
+if __name__ == "__main__":
+    import doctest
+
+    doctest.testmod(verbose=True)