Linear Probing in Python

class LinearProbeHashTable:
    def __init__(self, size):
        self.size = size
        self.keys = [None] * size
        self.values = [None] * size

    def hash_function(self, key):
        return hash(key) % self.size

    def put(self, key, value):
        index = self.hash_function(key)

        # Linear probing to find an empty slot
        while self.keys[index] is not None:
            if self.keys[index] == key:
                # If key already exists, update its value
                self.values[index] = value
                return
            index = (index + 1) % self.size

        # Insert the key-value pair
        self.keys[index] = key
        self.values[index] = value

    def get(self, key):
        index = self.hash_function(key)

        # Linear probing to find the key
        while self.keys[index] is not None:
            if self.keys[index] == key:
                return self.values[index]
            index = (index + 1) % self.size

        # Key not found
        return None


hash_table = LinearProbeHashTable(10)
hash_table.put('apple', 5)
hash_table.put('banana', 7)
hash_table.put('orange', 3)

print(hash_table.get('banana'))  # Output: 7
print(hash_table.get('grape'))   # Output: None