Set time complexity python

# empty set, avoid using {} in creating set or dictionary is created
x = set() 

# set {'e', 'h', 'l', 'o'} is created in unordered way
B = set('hello') 

# set{'a', 'c', 'd', 'b', 'e', 'f', 'g'} is created
A = set('abcdefg') 

# set{'a', 'b', 'h', 'c', 'd', 'e', 'f', 'g'} 
A.add('h')    

fruit ={'orange', 'banana', 'pear', 'apple'}

# True  fast membership testing in sets
'pear' in fruit      

'mango' in fruit     # False

A == B       # A is equivalent to B

A != B       # A is not equivalent to B

A <= B    # A is subset of B A <B>= B    

A > B     # A is proper superset of B

A | B        # the union of A and B

A & B     # the intersection of A and B

A - B        # the set of elements in A but not B

A ˆ B        # the symmetric difference

a = {x for x in A if x not in 'abc'}   # Set Comprehension

Similar codes

36 votes165 views10 answers
Python list keys from dictionary
Python
0 vote209 views1 answer
Tensorflow_version
Python
5 votes208 views6 answers
Joe biden
Python
1 vote223 views1 answer
Import different module based on python version
Python
1 vote175 views1 answer
How to remove seconds from datetime in python
Python
0 vote230 views1 answer
How to convert multi list into dict in python
Python
0 vote212 views1 answer
Python three periods
Python
9 votes197 views5 answers
How to make a window in pygame
Python
44 votes226 views6 answers
Remove string from list python
Python
0 vote244 views1 answer
Python selenium teardown class
Python