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

3 votes153 views1 answer
Pandas concat and reset index
Python
10 votes150 views2 answers
How to find length of number in python
Python
0 vote158 views1 answer
How to set text in QComboBox pyqt5
Python
0 vote185 views1 answer
NameError: name 'after_this_request' is not defined
Python
1 vote158 views1 answer
Generate number of n bits python
Python
0 vote160 views1 answer
Python own function and map function
Python
0 vote145 views2 answers
Historical tick bid ask
Python
0 vote148 views1 answer
Python find oldest and newest date
Python
0 vote158 views1 answer
P = pascal(3, 'upper', exact=False)
Python
0 vote150 views1 answer
How to make a username system using python
Python