A set is a Python collection used to store unique values. Unlike a list or tuple, a set does not keep duplicate items and does not use numbered positions for normal access. Sets are helpful when you care about whether a value exists, when you need to remove duplicates, or when you want to compare groups of values.

You create a set by placing comma-separated values inside curly braces. A set can contain strings, numbers, Boolean values, or other immutable objects. You may also create a set from another collection by using the set() function. Python automatically removes repeated values while building the set.

An empty set must be created with set(), not with empty curly braces. Empty curly braces create an empty dictionary instead. This is an important beginner detail. After creating the empty set, you can add values to it later with methods such as add() or update().

Every value in a set must be unique. When duplicate values are included, Python keeps only one copy. This feature makes sets very useful for cleaning repeated information. For example, a set can create a unique list of visitor names, product categories, email addresses, or numbers without writing a manual duplicate-checking loop.

Sets are described as unordered because their items are not stored for position-based access like list items. You should not expect a set to print values in the same order that you typed them. Because sets have no reliable indexes, expressions such as my_set[0] are invalid. Use membership checks or loops instead.

The add() method places one new item into a set. If the value already exists, the set remains unchanged because duplicates are not allowed. This method is useful when your program discovers or receives one value at a time, such as adding a new category, visitor, tag, or selected option.

The update() method adds several values to a set at one time. You can provide another set, a list, a tuple, or another iterable collection. Python reads each value and adds it if it is not already present. Existing duplicates are ignored, so the final collection still contains only unique values.

Python provides several ways to remove values from a set. The remove() method removes a known value, discard() safely removes a value if present, pop() removes an arbitrary value, and clear() removes everything. Choosing the correct method depends on whether the value must exist and whether you need to keep the set itself.

Both remove() and discard() can delete a specific value. The important difference appears when the value is missing. remove() raises a KeyError, while discard() finishes safely without changing the set. Use remove() when a missing value indicates a real problem, and use discard() when absence is acceptable.

The pop() method removes and returns one arbitrary item from a set. Because sets are unordered, you should not predict which value will be removed. Store the returned item in a variable when you need to know what was taken out. Calling pop() on an empty set raises a KeyError.

The clear() method removes every item from a set but keeps the set variable available. After clearing, you can add new values and continue using the same object. This is different from deleting the variable. Clearing is useful when resetting selected options, temporary results, visited pages, or other collected information.

The del statement deletes the set variable itself, not only its items. After deletion, trying to use the variable produces a NameError because the name no longer exists. Use del when the entire variable is no longer needed. Use clear() instead when you want to keep an empty reusable set.

The in operator checks whether a value exists inside a set. It returns True when the value is found and False when it is missing. The not in operator performs the opposite check. Set membership tests are usually fast, making sets useful for allowed values, blocked names, registered users, and lookup collections.

You can process every set item with a for loop. During each repetition, Python places one item into the loop variable. Because sets are unordered, the printing order is not guaranteed. Looping is useful for displaying unique tags, checking permissions, calculating results, or performing the same operation on every unique value.

A union combines all unique values from two or more sets. You can create it with the union() method or the vertical bar operator. Values that occur in both sets appear only once in the result. Union is useful for combining customer groups, course lists, permissions, product tags, or available features.

An intersection returns only values shared by both sets. You can use intersection() or the ampersand operator. This operation helps find common students, shared products, mutual interests, overlapping permissions, or matching records. If the sets share no values, the intersection result is an empty set.

A set difference returns values found in the first set but not in the second. You can use difference() or the minus operator. The direction matters because A minus B is usually different from B minus A. Difference is useful for finding missing registrations, unavailable products, or unmatched records.

A symmetric difference returns values that belong to either set but not to both. Shared values are removed from the result. You can use symmetric_difference() or the caret operator. This operation is useful when comparing changed selections, different memberships, mismatched records, or values unique to only one group.

A set is a subset of another set when every one of its values also exists in the other set. Use issubset() or the less-than-or-equal operator to test this relationship. Subset checks are useful for confirming that required permissions, selected ingredients, completed lessons, or requested features belong to an allowed larger collection.

A set is a superset when it contains every value from another set. Use issuperset() or the greater-than-or-equal operator. Superset checks are the reverse of subset checks. They help confirm that a user has all required permissions, a recipe has needed ingredients, or a record contains every required category.

Two sets are disjoint when they have no values in common. The isdisjoint() method returns True when there is no overlap and False when at least one shared item exists. This check is useful for detecting schedule conflicts, incompatible categories, separate user groups, or whether two collections contain any matching values.

A frozen set is an immutable version of a normal set. After creation, its items cannot be added, removed, or cleared. You create one with frozenset(). Frozen sets still support membership tests and comparison operations. Because they cannot change, they may be used as dictionary keys or values inside another set.

A set comprehension creates a set with a compact expression and loop. It is similar to a list comprehension, but it uses curly braces and automatically removes duplicate results. Set comprehensions are useful for transforming numbers, changing text, filtering values, or creating unique calculated results in one readable statement.

Converting a list to a set is a simple way to remove duplicate values. Python keeps one copy of each item. However, the original list order may not be preserved. When order matters, additional techniques are needed. This approach is useful for cleaning repeated names, numbers, tags, categories, or imported data.

Python sets support the same main ideas used in mathematical set theory: union, intersection, difference, symmetric difference, subset, superset, and disjoint tests. These operations let programs compare groups without complicated loops. They are useful in data analysis, permissions, recommendations, search systems, school records, and many classification tasks.

Lists are ordered and changeable, tuples are ordered and normally unchangeable, and sets are unordered collections of unique values. Choose a list when item order and duplicates matter. Choose a tuple for fixed ordered data. Choose a set for membership testing, duplicate removal, and mathematical comparisons between groups.

Sets are useful in real programs for finding unique visitors, shared interests, missing permissions, common products, repeated records, and differences between groups. Their membership tests and comparison operations can replace longer loops. A common application is comparing registered users with attendees to discover who has not arrived.

Practice helps you remember how sets behave. In these exercises, create sets, add and remove values, test membership, remove duplicates, and compare groups. Try each task before checking a solution. Pay attention to unordered output and remember that duplicate values appear only once inside a set.

This mini project compares students registered for two clubs. It finds everyone involved, students attending both clubs, and students attending only one club. The project combines union, intersection, and symmetric difference. It demonstrates how a few clear set operations can answer several practical questions without long nested loops.