Skip to content

Latest commit

 

History

History
27 lines (24 loc) · 947 Bytes

split_strings.md

File metadata and controls

27 lines (24 loc) · 947 Bytes
  • Complete the solution so that it splits the string into pairs of two characters. If the string contains an odd number of characters then it should replace the missing second character of the final pair with an underscore ('_').

  • Your task is to return the number of zero sequences if the given array is zero-plentiful, oherwise 0.

Example
* 'abc' =>  ['ab', 'c_']
* 'abcdef' => ['ab', 'cd', 'ef']

Solution 1:

import re
def solution(arr): 
    arr = arr+'_' if len(arr)%2 != 0 else arr 
    return re.findall('..?', arr)
  
print(solution(("asdfadsf"))) # ['as', 'df', 'ad', 'sf'] 

Solution 2:

def solution(arr): 
    arr = arr+'_' if len(arr)%2 != 0 else arr 
    return list(map(''.join, zip(*[iter(arr)]*2)))
   
print(solution(("asdfads"))) # ['as', 'df', 'ad', 's_'] 
print(solution(("x"))) # 2 ['x_]