Sets for Membership and Dedup

Sets answer membership in average O(1): deduplicate, test intersection emptiness, or track visited states in grids with encoded tuples (r,c).

Why this shows up in the real world

Security allowlists, tag systems, and graph algorithms (visited set in BFS/DFS).

Core idea (explained for students)

a & b, a | b, a - b for set algebra. For frequency ignoring multiplicity, set of keys from counter.

Try this in Python

a = {1, 2, 3}
b = {2, 3, 4}
print(a & b, a | b, a - b)

Common mistakes

• Unhashable elements in set.
• Confusing multiset operations—sets lose multiplicity.

Key takeaways

• frozenset inside another set when you need set-of-sets.
• For near-linear dedup of huge file: streaming set may explode—consider Bloom filters (advanced).