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 vote170 views1 answer
Use python3.7 as default
Python
0 vote163 views1 answer
How to print keys and values of dictionary together in python?
Python
0 vote169 views1 answer
Adding extra fields to user model django
Python
34 votes189 views5 answers
String replace in python
Python
-1 vote184 views1 answer
Pyhton mcq
Python
16 votes175 views6 answers
Django forms
Python
0 vote181 views1 answer
Pandas df make set index column
Python
0 vote187 views1 answer
Username python system
Python
2 votes221 views2 answers
Python !=
Python
0 vote169 views2 answers
Max between two numbers python
Python