practice hash tables
- Hash table is a key value store.
- Deletion, adding, or accessing are all operation that run in constant time.
- keys and be strings
- under the hood, hash tables are just arrays
- We using a hasing function to turn string into interger
- Sometimes that hasing functions will map a string to the same index, thats called collisions.
- There are modern hashing functions that minimize collisions considerably.