Python Sets: Operations, Methods & Set Theory

A Set is an unordered collection of unique elements in Python. Sets are built on hash tables, which makes them highly optimized for membership testing—determining whether a specific element is inside the collection. While checking if an item is in a list requires scanning every item (an `O(N)` operation), checking membership in a set runs in `O(1)` constant time. This makes sets incredibly powerful for duplicate elimination and bulk data filtering.

Sets are initialized using curly braces `{}` containing values (without colons) or by using the built-in `set()` constructor. Note that since curly braces are also used for dictionaries, writing empty curly braces `{}` initializes an empty dictionary. To initialize an empty set, you must use `set()`. Elements inside a set must be hashable and immutable, which means you can store numbers, strings, and tuples, but you cannot store lists or dictionaries inside a set.

Beyond basic addition and deletion methods, Python sets natively support operations from mathematical Set Theory. This includes Union (`|` or `.union()`) to merge collections, Intersection (`&` or `.intersection()`) to find common elements, Difference (`-` or `.difference()`) to find elements unique to one collection, and Symmetric Difference (`^`) to retrieve items in either set but not both. Mastering sets allows you to solve complex grouping problems with clean, performant, and readable code.