Why sets are used in Python - Visual Breakdown

Concept Flow - Why sets are used

Create a set with items

↓

Add or remove items

↓

Check if item exists quickly

↓

Perform set operations: union, intersection, difference

↓

Use results for unique items or fast membership tests

Sets store unique items and allow fast checks and operations like union or intersection.

Execution Sample

Python

fruits = {'apple', 'banana', 'apple', 'orange'}
print(fruits)
print('banana' in fruits)
fruits.add('grape')
print(fruits)

This code creates a set of fruits, shows unique items, checks membership, and adds a new fruit.

Execution Table

Step	Action	Set Content	Output
1	Create set with {'apple', 'banana', 'apple', 'orange'}	{'apple', 'banana', 'orange'}
2	Print set	{'apple', 'banana', 'orange'}	{'apple', 'banana', 'orange'}
3	Check if 'banana' in set	{'apple', 'banana', 'orange'}	True
4	Add 'grape' to set	{'apple', 'banana', 'orange', 'grape'}
5	Print set after adding 'grape'	{'apple', 'banana', 'orange', 'grape'}	{'apple', 'banana', 'orange', 'grape'}

💡 Execution ends after printing the updated set with 'grape' added.

Variable Tracker

Variable	Start	After Step 1	After Step 4	Final
fruits	undefined	{'apple', 'banana', 'orange'}	{'apple', 'banana', 'orange', 'grape'}	{'apple', 'banana', 'orange', 'grape'}

Key Moments - 3 Insights

Why does the set only have one 'apple' even though it was added twice?

Sets automatically keep only unique items, so duplicates like the second 'apple' are ignored (see execution_table step 1).

How does checking if 'banana' is in the set work so fast?

Sets use a special structure that lets them check membership quickly without searching all items (see execution_table step 3).

What happens when we add 'grape' to the set?

The set adds 'grape' only if it is not already present, updating the set content (see execution_table step 4).

Visual Quiz - 3 Questions

Look at the execution_table, what is the content of the set after step 1?

A {'apple', 'banana', 'orange'}

B {'apple', 'banana', 'apple', 'orange'}

C {'banana', 'orange'}

D {'apple', 'banana', 'orange', 'grape'}

💡 Hint

Check the 'Set Content' column for step 1 in the execution_table.

At which step does the set include 'grape'?

A Step 3

B Step 4

C Step 2

D Step 5

💡 Hint

Look at the 'Set Content' column in execution_table steps 3 and 4.

If we add 'apple' again after step 4, what will happen to the set?

A It will add another 'apple', increasing size

B It will remove the existing 'apple'

C It will ignore the new 'apple' because it's a duplicate

D It will cause an error

💡 Hint

Refer to key_moments about uniqueness and execution_table step 1.

Concept Snapshot

Sets store unique items only.
They allow fast membership checks.
Duplicates are ignored automatically.
You can add or remove items.
Useful for unique collections and set math.

Full Transcript

This lesson shows why sets are used in Python. Sets keep only unique items, so duplicates are removed automatically. They allow very fast checks to see if an item is inside. You can add new items, and the set updates only if the item is new. This makes sets great for storing unique things and doing operations like union or intersection quickly.