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

35 votes306 views6 answers
How to make a virtual environment python 3
Python
0 vote288 views1 answer
Install pip and add virtual environment to the Python Kernel
Python
0 vote326 views1 answer
Python remove consecutive spaces
Python
0 vote283 views1 answer
Pd calculations between columns
Python
0 vote286 views1 answer
Imagedatagenerator split train test
Python
0 vote288 views1 answer
Xpath start-with python
Python
8 votes275 views3 answers
Can't find model 'en_core_web_sm'
Python
0 vote318 views1 answer
Equal Sides Of An Array python
Python
10 votes317 views3 answers
Text recognition python library
Python
4 votes283 views2 answers
Finding median on python
Python