How is the complexity of removing an element from a set in Python estimated?

In Python, a set (set) is implemented based on a hash table, so the operation of removing an element by value is usually performed in amortized O(1) time. This means that on average, removal happens very quickly regardless of the size of the set. However, in the worst case (for example, with a large number of hash collisions), the complexity can increase, but such situations are rare due to good hash function distribution.

Example of removing an element:

s = {1, 2, 3, 4}
s.remove(3)  # removes the element 3 from the set