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

1 vote179 views1 answer
Python delete first two indexes
Python
0 vote173 views1 answer
Django post request 403 forbidden
Python Django
0 vote222 views1 answer
Python community
Python
3 votes153 views1 answer
Pandas apply function to each row lambda
Python
9 votes130 views1 answer
Mac upgrade python to 3.8
Python
0 vote178 views1 answer
Power of array
Python
0 vote151 views1 answer
[E053] Could not read config.cfg from C:\Users\hp\AppData\Local\Programs\Python\Python37\lib\site-packages\resume_parser\degree\model\config.cfg
Python
0 vote159 views1 answer
Rotch randn
Python
0 vote117 views0 answer
Python
1 vote164 views1 answer
Read a function of excel in python
Python