main.py

class HashTable:
	def __init__(self):
		self.collection = {}
	
	def hash(self, value):
		return sum([ord(char) for char in value])

	def add(self, key, value):
		hash_value = self.hash(key)

		if hash_value in self.collection:
			self.collection[hash_value][key] = value
		else:
			self.collection[hash_value] = {key: value}

	def remove(self, key):
		hash_value = self.hash(key)
		
		if hash_value in self.collection and key in self.collection[hash_value]:
			self.collection[hash_value].pop(key)

	def lookup(self, key):
		hash_value = self.hash(key)
		
		if hash_value in self.collection and key in self.collection[hash_value]:
			return self.collection[hash_value][key]

		return None

# ========================
# Example usage
# ========================

# ht = HashTable()

# ht.add("name", "John")
# ht.add("age", 30)
# ht.add("city", "LA")

# print(ht.lookup("name"))   
# print(ht.lookup("age"))    
# print(ht.lookup("country"))

# ht.remove("age")

# print(ht.lookup("age"))

# # Handling collisions
# ht.add("abc", 123)
# ht.add("cba", 456)
# print(ht.lookup("abc"))
# print(ht.lookup("cba"))

# print(ht.collection)