Exercise 37: Hashmaps

Hash maps (hashmaps, hashes, or sometimes dictionaries) are used frequently in dynamic programming languages for storing key/value data. A Hashmap works by performing a hashing calculation on the keys to produce an integer, then uses that integer to find a bucket to get or set the value. It's a very fast, practical data structure, because it works on nearly any data and is easy to implement.

Here's an example of using a Hashmap (aka, dictionary) in Python: