hasmap

class Bucket:
    def __init__(self):
        self.bucket = []

    def get(self, key):
        for (k,v) in self.bucket:
            if k == key:
                return v
        return -1

    def put(self, key, val):
        found = False
        for i, (k,v) in enumerate(self.bucket):
            if (k == key):
                self.bucket[i] = (key, val)
                found = True
        if (not found):
            self.bucket.append((key, val))
            print(self.bucket)

    def remove(self, key):
        for i, (k,v) in enumerate(self.bucket):
            if (k == key):
                del self.bucket[i]

class MyHashMap:
    def __init__(self):
        self.hashTable = [Bucket() for _ in range(1027)]

    def get(self, key):
        index = hash(key) % len(self.hashTable)
        return self.hashTable[index].get(key)

    def put(self, key, val):
        index = hash(key) % len(self.hashTable)
        self.hashTable[index].put(key, val)

    def remove(self, key):
        index = hash(key) % len(self.hashTable)
        self.hashTable[index].remove(key)


# map = MyHashMap()
# map.put(1,2)
# print(map.get(1))
# map.remove(1)