How do I implement a hash table in Python?

How do I implement a hash table in Python?

To implement a hash table in Python, you can use a dictionary, which is a built-in hash table. Here's a simple example:

class HashTable:
    def __init__(self):
        self.table = {}

    def insert(self, key, value):
        self.table[key] = value

    def get(self, key):
        return self.table.get(key)

    def delete(self, key):
        if key in self.table:
            del self.table[key]

Can you explain how this works?

Sure! In this implementation, the HashTable class uses a Python dictionary to store key-value pairs. The insert method adds a new key-value pair, get retrieves the value for a given key, and delete removes a key-value pair.

How would this be different in Java?

In Java, you would typically use the HashMap class from the java.util package. Here's a basic example:

import java.util.HashMap;

class HashTable {
    private HashMap<String, String> table;

    public HashTable() {
        table = new HashMap<>();
    }

    public void insert(String key, String value) {
        table.put(key, value);
    }

    public String get(String key) {
        return table.get(key);
    }

    public void delete(String key) {
        table.remove(key);
    }
}

What about in JavaScript?

In JavaScript, you can use an object or the Map class. Here's an example using an object:

class HashTable {
    constructor() {
        this.table = {};
    }

    insert(key, value) {
        this.table[key] = value;
    }

    get(key) {
        return this.table[key];
    }

    delete(key) {
        delete this.table[key];
    }
}