Python Sets: Unique Values & Set Theory Algebra
A `Set<T>` is an unordered collection of unique elements backed by hash tables. Adding duplicate values has no effect. Sets offer lightning-fast $O(1)$ lookup times via `.contains()` and provide native set algebra operations: `.union()`, `.intersection()`, and `.difference()`.
"A Set is like a VIP guest list with a strict bouncer at the door: your name is either on the list or it isn't, and no guest can be added twice."
Deep Dive: How It Works
Uniqueness by Hash Code: Elements are evaluated for equality using `hashCode` and `operator ==`.
$O(1)$ Lookup: Checking `set.contains(item)` is instantaneous compared to linear $O(N)$ list scans.
Set Algebra: `.intersection()` finds shared elements, `.difference()` finds unique elements in set A not in B.
Syntax Blueprint
var setA = {"Flutter", "Dart", "React"};
var setB = {"Dart", "Go", "Rust"};
var common = setA.intersection(setB); // {"Dart"}
var all = setA.union(setB); // Combined uniqueSet creation and relational set operations.
Core Rules to Remember
Common Beginner Traps & How to Fix Them
Writing `var x = {};` expecting an empty Set.Why it happens: `{}` defaults to an empty `Map<dynamic, dynamic>` for legacy reasons.
How to fix: Write `var x = <String>{};` or `Set<String> x = {};` to declare an empty Set.
Live Interactive Example
Hit Run Code to see it liveYour Turn: Micro Challenge
No pressure! Edit the starter code below and test your solution with instant feedback.
Deduplicate Tags with Set
- Given `final duplicateTags = ["ui", "dart", "ui", "flutter", "dart"];`.
- Convert it to a Set `final unique = duplicateTags.toSet();`.
- Print `Unique count: ${unique.length}`.
Finished reading and practicing?
Mark this lesson as completed to update your course progress.