A set that handles all kinds of objects (hashable or not) and preserves the order of the elements
provides a simple and efficient way to remove duplicates from an iterable (even with unhashable elements, optional order preservation)
Provides a convenient and efficient way to count the occurrences of items (hashable and unhashable) in a list
