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

0 vote192 views1 answer
Micropython free space esp32 esp2866
Python
0 vote220 views1 answer
How to create superuser in django heroku
Python Django
15 votes227 views4 answers
Django python install
Python Django
1 vote187 views2 answers
How to add sum of range in python
Python
33 votes184 views6 answers
Convert list to string
Python
0 vote198 views1 answer
Python run scp command
Python
0 vote210 views1 answer
Blender python select object by name
Python
0 vote205 views1 answer
Python tkinter dynamic toggle button
Python
0 vote203 views1 answer
Css selenium
Python
0 vote194 views2 answers
Add percentage sign to string python
Python