Instruction
Before we dive into the actual applications of sets, let's do a quick review.

As you may remember, sets are unordered collections of elements – there is no "first" or "last" element. Also, sets can only store unique elements; duplicates are not allowed.
Let's take a look at some basic set operations:
- Define a set:
- Add an element:
- Remove one element:
- Remove all elements:
- Iterate over a set:
- Check if an element is in a set:
empty_set = set()
letters = {'a', 'd', 'f', 'h'}
letters.add('t')
letters.discard('d')
letters.clear()
for letter in letters: ...
if letter in letters: ...
How about a quick warmup exercise?
Exercise
Write a function named count_unique_letters(word) that accepts a string argument and returns the number of unique letters (characters) in the word.
Stuck? Here's a hint!
Within a loop, add each letter of the string to a set. Then, return the length of the set with:
len(unique_letters)



