# A set contains unique elements of which the order is not important
s = set()
s.add(1)
s.add(2)
s.remove(1)
print(s)
# Can also be created from a list (or some other data structures)
num_list = [1,2,3]
set_from_list = set(num_list)# Creating an empty set
b = set()
print(type(b))
## Adding values to an empty set
b.add(4)
b.add(4)
b.add(5)
b.add(5) # Adding a value repeatedly does not changes a set
b.add((4, 5, 6))
## Accessing Elements
# b.add({4:5}) # Cannot add list or dictionary to sets
print(b)
## Length of the Set
print(len(b)) # Prints the length of this set
## Removal of an Item
b.remove(5) # Removes 5 fromt set b
# b.remove(15) # throws an error while trying to remove 15 (which is not present in the set)
print(b)
print(b.pop())
print(b)set_name = {item1, item2, ...}# Python also has sets which you can use
# Keep in mind that sets cannot have duplicate of the same value
# This can be useful for removing doubles in a list
mySet = {1, 2, 2, 3, 4, 5, 10, 10, 15}
print(mySet) # {1, 2, 3, 4, 5, 10, 15}
# You can also create a set with 'set([list elements])'
myList = ['apples', 'bananas', 'oranges', 'grapes']
myList.append('apples')
myList.append('oranges')
print(myList) # ['apples', 'bananas', 'oranges', 'grapes', 'apples', 'oranges']
myNewSet = set(myList)
print(myNewSet) # {'apples', 'bananas', 'oranges', 'grapes'}#Definition: A collection of values (similiar spirit to python dictionary)
# implementing hash table as a data structure underneath the hood.a = {1, 3, 4, 5, 1}
print(type(a))
print(a)
b = {1, 2, 6, 7, 2, 2, 2}
print(type(b))
print(b)