Question

In python,write a function nameSet(first, last) that takes a person's first and last names as input, and returns a tuple of three strings: the first string gives the union of all letters in the first and last names (no duplication though). The second string gives the intersection of letters in the first and last names, i.e. the common letters. If there are no common letters, then the second string is empty (''). The third string gives the symmetric difference between the first and last names, i.e., letters that only appear in one name but not the other name. Letters in the three strings should be sorted alphabetically. Ignore case. Example: nameSet('George', 'Washington') will return ('aeghinorstw', 'go', 'aehinrstw').

Answer 1

def nameSet(first, last):
    setF = set(first.lower())
    setL = set(last.lower())
    result1 = list(setF.union(setL))
    result2 = list(setF.intersection(setL))
    result3 = list(setF.symmetric_difference(setL))
    result1.sort()
    result2.sort()
    result3.sort()
    res1 = ''.join([str(x) for x in result1])
    res2 = ''.join([str(x) for x in result2])
    res3 = ''.join([str(x) for x in result3])
    return (res1, res2, res3)


# Testing
print(nameSet('George', 'Washington'))