In Python, what is the fastest algorithm for removing duplicates from a list so that all elements are unique *while preserving order*? [duplicate]

by 
def unique(items):
    found = set()
    keep = []

    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])

More Related Contents:

  1. Removing duplicates in lists
  2. Permutations between two lists of unequal length
  3. How to efficiently compare two unordered lists (not sets) in Python?
  4. Pythonic way to check if a list is sorted or not
  5. Detecting consecutive integers in a list [duplicate]
  6. How to efficiently compare two unordered lists (not sets)?
  7. Checking if all elements in a list are unique
  8. Complexity of list.index(x) in Python
  9. Python: find closest string (from a list) to another string
  10. Sliding window maximum in O(n) time
  11. How to split an iterable into two lists with alternating elements
  12. How can I match up permutations of a long list with a shorter list (according to the length of the shorter list)? [duplicate]
  13. Python – Removing overlapping lists
  14. Find non-common elements in lists
  15. How to make a dict from n’th indices of tuples in list
  16. How do I concatenate items in a list to a single string?
  17. Why does this iterative list-growing code give IndexError: list assignment index out of range?
  18. Slicing a list in Python without generating a copy
  19. Python list doesn’t reflect variable change
  20. merging Python dictionaries
  21. Accessing the list while being sorted
  22. Modifying a list inside a function
  23. How does the max() function work on list of strings in python?
  24. How do I sort this list in Python, if my date is in a String?
  25. Convert all strings in a list to integers
  26. What is the time complexity of heapq.nlargest?
  27. Understanding change-making algorithm
  28. Python Sort One List According to Another List
  29. counting combinations and permutations efficiently
  30. deque.popleft() and list.pop(0). Is there performance difference?

Leave a Comment