for item in items:
    if item not in found:
        found.add(item)
keep.append(item)
return keep
print(unique([1, 1, 2, 'a', 'a', 3]))
In Python, what is the fastest algorithm for removing duplicates from a list so that all elements are unique *while preserving order*?