Python Sets Tutorial #1 & Time Complexity (BIG O)

In this video I explain how to implement sets in python and explain the main advantages and disadvantages of them. I go over creating sets, removing and adding items and talk about the time complexity of these operations. Sets are an unordered collection of unique elements. They can perform the following three operations in constant (O(n)) time: 1. in 2. add 3. remove Use sets when you want check if elements exist and don't care about the order or frequency of them. Support the Channel: https://www.patreon.com/techwithtim Join my discord server: https://discord.gg/pr2k55t Please leave a LIKE and SUBSCRIBE for more content! Tags: - Tech With Tim - Sets in python - Python Tutorials - Python set tutorial - Using sets python - Time complexity of sets python - Sets Python - Sets Python 3