#TUPLES -> ()), like list but it is immutuable, faster than list # my_tuple = (1,2,3,4,5,5,5) # print(my_tuple.count(5)) # new_tuple = my_tuple[1:4] # print(new_tuple) # x,y,z, *other = (1,2,3,4,5) # print(other) #SETS -> {}, unordered, unique, can't contain duplicates, doesn't support indexing # my_set = {1,2,3,4,5} # # my_set.add(100) # # my_set.add(2) # new_set = my_set.copy() # print(len(my_set)) # print(new_set) my_set = {4,5} your_set = {4,5,6,7,8,9,10} # print(my_set.difference(your_set)) # print(my_set.discard(5)) # print(my_set) # print(my_set.difference_update(your_set)) # print(my_set) # print(my_set.intersection(your_set)) # print(my_set.isdisjoint(your_set)) # print(my_set.union(your_set)) # | # print(my_set.issubset(your_set)) # print(my_set.issuperset(your_set))