Find non-common elements in lists

by

Use the symmetric difference operator for sets (aka the XOR operator):

>>> set([1,2,3]) ^ set([3,4,5])
set([1, 2, 4, 5])

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. Python Sets vs Lists
  5. Pythonic way to check if a list is sorted or not
  6. Python -Intersection of multiple lists?
  7. Detecting consecutive integers in a list [duplicate]
  8. In Python, when to use a Dictionary, List or Set?
  9. What makes sets faster than lists?
  10. How to efficiently compare two unordered lists (not sets)?
  11. In Python, what is the fastest algorithm for removing duplicates from a list so that all elements are unique *while preserving order*? [duplicate]
  12. Add list to set
  13. How to construct a set out of list items in python?
  14. How to compare a list of lists/sets in python?
  15. How to make a set of lists
  16. Complexity of list.index(x) in Python
  17. What is the difference between sets and lists in Python?
  18. Get unique values in List of Lists
  19. Which is faster and why? Set or List?
  20. Python: find closest string (from a list) to another string
  21. What is time complexity of a list to set conversion?
  22. Fastest way to search a list in python
  23. Sliding window maximum in O(n) time
  24. Get difference between two lists with Unique Entries
  25. How to split an iterable into two lists with alternating elements
  26. How can I match up permutations of a long list with a shorter list (according to the length of the shorter list)? [duplicate]
  27. set of list of lists in python
  28. A set union find algorithm
  29. Python: powerset of a given set with generators [duplicate]
  30. Python – Removing overlapping lists

Leave a Comment