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 vote322 views1 answer
How to get pytroch model layer name
Python
0 vote260 views1 answer
Splitting strings in Python without split()
Python
2 votes256 views4 answers
How to count special values in data in python
Python
0 vote284 views2 answers
Remove empty lines from file python
Python
0 vote341 views1 answer
Django queryset all objects
Python
5 votes259 views1 answer
Python undefine variable
Python
0 vote275 views1 answer
You will be passed a file path P and string S on the command line. Output the number of times the string S appears in the file P.
Python
0 vote245 views1 answer
Pandas heading
Python
0 vote285 views1 answer
Pygame.event.get() in pygame
Python
-1 vote312 views1 answer
Flask run on ip and port
Python Flask