Hash Sets

Question 1

What is the time complexity of searching and inserting values into a hash set in Python?

Answer 1

O(1) - constant

Question 2

What is the main advantage of hash sets over lists in Python?

Answer 2

It eliminates any duplicates

Question 3

How would we look for the value 1 in the following hash set:

{0, 1, 2, 3}

Answer 3

print(1 in mySet)

Will return True

Question 4

How can we remove values in a hash set and what is the time complexity of this operation?

Answer 4

mySet.remove(1), O(1) time

Question 5

How can we initialize multiple values into our set?

Answer 5

set([1, 2, 3])

result will be = {1, 2, 3}

Question 6

How can we initialize multiple values into a set using list comprehension?

Answer 6

mySet = {i for i in range(5)}