#Implement hash table collision handling using linear probing

# class Hashtable:
#     def __init__(self):
#         self.max = 10
#         self.arr = [None for i in range(self.max)]
#
#     def get_hash_(self, key):
#         h = 0
#         for ch in key:
#             h += ord(ch)
#         return h % self.max
#

