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 vote107 views1 answer
How to merge two column pandas
Python
0 vote76 views1 answer
Python extract mails from string
Python
0 vote122 views1 answer
Ssl expired python
Python
1 vote101 views1 answer
How to delete an attribute of an object python
Python
8 votes97 views4 answers
Create an array with same value python
Python
0 vote106 views1 answer
Ursina code
Python
0 vote104 views1 answer
Wkhtmltopdf pdfkit blocked access to file
Python
3 votes94 views2 answers
Multiple variable input in python
Python
2 votes110 views2 answers
Pandas update with condition
Python
0 vote110 views1 answer
How stract avery .jpg string in a website python
Python