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 votes329 views2 answers
Python set cwd to script directory
Python
48 votes339 views6 answers
Random password generator python
Python
0 vote328 views1 answer
Make tkinter text editing disabled
Python
0 vote299 views1 answer
Display multiple dataframe as table jupyter notebook
Python
0 vote311 views1 answer
Assign exec function to variable python
Python
1 vote341 views1 answer
Snowflake python connector error handling
Python
0 vote305 views1 answer
Torch split classes stratified
Python
0 vote298 views1 answer
Password protected cmd python
Python
0 vote320 views1 answer
Python bangla packages
Python
4 votes305 views1 answer
How to make a list string in python
Python