We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Algorithms
  3. Strings
  4. Morgan and a String
  5. Discussions

Morgan and a String

  • oorja
     + 1 comment

    This is my version of you ruby solution in python3

    for i in range(int(input())):
    s1 = input().strip()
    s2 = input().strip()
    len1 = len(s1)
    len2 = len(s2)
    i, j = 0,0
    output = []
    while (i <= len1 - 1)  and (j <= len2 - 1):
        if s1[i:-1] < s2[j:-1]:            
            output.append(s1[i])
            i += 1
        else:
            output += s2[j]
            j += 1
    if i == len1:
        output.append(s2[j:])
    if j == len2:
        output.append(s1[i:])
    
    print("".join(output))

    It does fail on a lot of test. I would give it a try on GO language and see how it behaves. I feel downloading test files are allowed instead of rendering on browser.