PYTHON
Efficiently Manage Unique Elements with Python Sets
Leverage Python's built-in set data structure to quickly remove duplicates from lists and perform common set operations like union, intersection, and difference for data manipulation.
my_list = [1, 2, 2, 3, 4, 4, 5]
unique_elements = set(my_list)
set_a = {1, 2, 3, 4}
set_b = {3, 4, 5, 6}
# Union: elements in A or B or both
union_set = set_a.union(set_b) # or set_a | set_b
# Intersection: elements in both A and B
intersection_set = set_a.intersection(set_b) # or set_a & set_b
# Difference: elements in A but not in B
difference_set = set_a.difference(set_b) # or set_a - set_b
# Symmetric Difference: elements in A or B but not in both
symmetric_difference_set = set_a.symmetric_difference(set_b) # or set_a ^ set_b
print(f"Original list: {my_list}")
print(f"Unique elements: {unique_elements}")
print(f"Union (A|B): {union_set}")
print(f"Intersection (A&B): {intersection_set}")
print(f"Difference (A-B): {difference_set}")
print(f"Symmetric Difference (A^B): {symmetric_difference_set}")
How it works: Python sets are unordered collections of unique elements. This snippet demonstrates how to convert a list to a set to automatically remove duplicates. It then shows various set operations like union, intersection, difference, and symmetric difference, which are highly efficient for comparing and combining collections of unique items. Sets are ideal for membership testing and eliminating redundancy, often performing better than lists for these tasks.