What is the time complexity of different Python collections?

What is the time complexity of lists in Python?

In Python, the average time complexity for accessing an element in a list is O(1), while appending an element is O(1) as well. However, inserting or deleting an element can take O(n) time.

How about dictionaries?

Dictionaries in Python have an average time complexity of O(1) for lookups, insertions, and deletions due to their underlying hash table implementation.

What about sets?

Sets also have an average time complexity of O(1) for lookups, insertions, and deletions, similar to dictionaries.

Are there any collections with worse time complexity?

Yes, for example, a Python list has O(n) time complexity for operations like inserting or deleting elements at arbitrary positions.