Reading

Hash Tables

• Use key/value pairs
• Creates associative arrays
• Every time you look up a value in the hash table it gives you the index where it exists
• A linked list can be applied to an index position to handle collisions.

source: https://www.youtube.com/watch?v=MfhjkfocRR0