## Algorithms
- data structure is basically a [[Hashmaps|Hash Table]], but the difference is a set does not map their keys to anything
- more convenient to use than hashmap when you only care about checking if an element exists or not
- You can add, remove, and check if an element exists in a set all in $𝑂(1)$
- sets don't track frequency, only unique elements
- trick in python to get random element ($O(1)$):
- next(iter(the_set))