Hashtables in Java

Hash tables are useful data structures because they offer constant-time average-case complexity for insertion, deletion, and lookup operations, making them efficient for storing and retrieving key-value pairs.

Hashtables use hash functions to determine where each element is to be stored.

Properties of a good hash function

1. Must be deterministic
2. Uniform distribution accross output range
3. Should minimize collisions
4. Should be fast/easy to compute

For a more in-depth look at hashtables visit this article at geeksforgeeks.org