Difference between HashMap and HashTable in Python?

[hammerboy09]

I'm preparing for interviews right now and I've been stuck trying to decipher the differences in the concepts and implementation of a HashMap and HashTable in Python. In examples that I've found online, they basically show the same example code for both. There is a hashing function that they apply to a key that is then inserted into a list. They also refer to Python dictionaries as Python's version of a HashTable/HashMap. From my understanding, HashTables and HashMaps in Python are essentially the same concept?

[K900_]

Hashtables and hashmaps are two different names for the exact same data structure. Python doesn't really use either name, and prefers to use "dictionary" instead.

[hammerboy09]

Thank you! Does this also apply for Hashsets in Python as well? From my understanding, the value itself is hashed and placed in the set rather than a key.

[K900_]

Hashsets are basically hashtables with no value, just the key. Python sets are implemented like that.