LearnViz CompSci
Home / Learn / Programming Fundamentals / Sets

Intermediate Topic 21 of 54 Programming Fundamentals

Sets

Unordered collections of unique elements supporting union and intersection.

How it works

A set stores unique items, backed by a hash table or a balanced tree, with fast membership tests and set algebra such as union, intersection and difference. Adding an existing item has no effect. Hash-based sets give average O(1) operations but no order, whereas tree-based sets keep elements sorted.

Step-by-step walkthrough

  1. Set A and set B each hold unique elements.
  2. Union combines everything: 1 2 3 4 5.
  3. Union also takes B.
  4. Intersection keeps only the shared element 3.
  5. Intersection also checks B.

Where it is used

Removing duplicates, checking permissions, finding common friends between users, tracking visited nodes in graph search and comparing two lists for differences are typical uses. Sets express intent more clearly than lists filtered by hand.

Common pitfall

Sets are unordered, and elements must be hashable, so lists and other mutable items cannot be stored directly. Do not rely on iteration order. Converting a list to a set to deduplicate loses the original order unless you handle it explicitly.

Where it fits in the course

Sets is topic 21 of 54 in Programming Fundamentals, rated Intermediate. It follows Dictionaries and Maps. The next topic is Tuples.

Practice and explore

How to study this topic

  1. Read the explanation above and restate the definition in your own words.
  2. Open the interactive lesson and answer its mini quiz.
  3. Read the common pitfall, then write a short example that avoids it.
  4. Check your understanding in the Programming Fundamentals quiz, and revisit the topic if you miss a question.

Frequently asked questions

What is Sets?
Unordered collections of unique elements supporting union and intersection. It belongs to Programming Fundamentals and is an intermediate-level topic.
Where do people use Sets?
Removing duplicates, checking permissions, finding common friends between users, tracking visited nodes in graph search and comparing two lists for differences are typical uses.
What is the most common mistake with Sets?
Sets are unordered, and elements must be hashable, so lists and other mutable items cannot be stored directly.
What should I learn before this topic?
Start with Dictionaries and Maps, the topic just before it in Programming Fundamentals.
How can I practice it?
Answer the mini quiz in the interactive lesson, then take the Programming Fundamentals quiz.
Is Sets hard to learn?
It is an Intermediate topic. Be comfortable with the Beginner topics in this area first, then read the common pitfall carefully, since it is where most mistakes happen.
How long does it take to learn Sets?
Most learners can read the explanation and finish the interactive lesson in under an hour. Fluency comes from applying the idea, so plan a few short practice sessions with the quiz.
Which topics are related to Sets?
Dictionaries and Maps, Tuples, Strings are closely connected. The full list is in the related topics section of this page.
What should I study after Sets?
Continue with Tuples, the next topic in Programming Fundamentals.

Related topics