Data structure manipulation

Insert an element into a set while maintaining uniqueness.

Data processing: building a collection of unique items; Log analysis: deduplicating input lines; Iteration: tracking seen values during loop

Any Python code using sets, such as processing logs, graph algorithms, or caching unique keys.

set_var.add(element)

... .add(...)

set_var: identifier of a set, element: hashable object to add

• set initialization
• set comprehension
• membership testing with 'in'
• iterating over sets

• Using list.append for lists
• set.update to add multiple elements
• or set |= {elem} for union

Calling .add on a list (which uses .append), attempting to add unhashable types like lists or dicts to a set, expecting a return value from .add

list.append (adds to end of list, allows duplicates), set.update (adds multiple elements from an iterable)

Coming from Java: Set.add behaves similarly, but Python sets require hashable items and are unordered.

• set initialization
• set comprehension
• set removal (.discard
• .remove)
• set union/intersection

Operation is O(1) average; if element already present, set unchanged; returns None.

Guarantees a collection of unique elements without manual duplicate checks.

Think of dropping a fruit into a basket that only keeps one of each kind.

.add returns None, so it cannot be chained; operation is O(1) average case; if element already present, set remains unchanged.

Using set.update(|=) to add multiple elements at once, or using frozenset for immutable sets.