Oracle Hashing Interview: HashMap Internals & Collisions

What this question asks

You will be asked to explain hashing fundamentals and demonstrate how a HashMap (array + buckets) works in practice, often with Java examples. Expect to cover how keys map to indices via a hash function, what makes a good hash (consistency, uniform distribution), and how collisions are handled in real implementations.

Typical flow in an interview

1. Briefly define hash functions and the hash table structure.
2. Walk through a simple insert/get example (show index calculation, bucket selection).
3. Discuss collision resolution strategies (separate chaining vs open addressing) and Java-specific optimizations (when buckets become trees).
4. Explain resizing/rehashing triggered by the load factor and trade-offs involved.
5. If given code, analyze correctness, potential collisions, and complexity; expect follow-ups testing edge cases and custom hashCode/equals implementations.

Skills and signals you should demonstrate

• Clear understanding of hash functions and uniform distribution
• Ability to reason about collision resolution trade-offs and performance (average/worst-case complexities)
• Knowledge of resizing and rehashing costs and amortized analysis
• Java-specific details: hashCode/equals contract, best practices for custom classes, and when HashMap uses tree nodes
• Practical coding ability: implement or debug a hash table variant and justify design choices

Prepare by implementing simple hash tables (chaining and open addressing), writing correct hashCode/equals for custom types, and reviewing Java HashMap source/behavior under high-collision scenarios.