Asked about Lists, dictionaries and sets
Why is checking membership in a set faster than in a list?
An answer that works
A list has to compare against each item in turn, so the time grows with its length. A set uses a hash table, so it jumps straight to where the item would be. That takes the same time regardless of size.
Reading an answer is not being able to give one. The section that teaches this is Lists, dictionaries and sets, 3 hours of Python.
Learn this properlyAlso asked about Python
What is the difference between a list and a tuple?Why use join instead of adding strings in a loop?What is the difference between == and is?What does s[::-1] do?How would you remove duplicates from a list?What happens if you use a list as a dictionary key?What is the difference between sorted(x) and x.sort()?What is wrong with def f(items=[])?
All 36 questions on Python