Why can a HashMap have one null key but a Hashtable cannot?
PICTURE THIS: HASH MAP
Simple meaning
HashMap treats a null key as a special case and stores it in a dedicated bucket.
WHY — Collections instead of guessing?
Why interviewers care about Collections:
on Collections.
the situation, the default choice, and one exception - that reads as experience.
Name the idea, why it exists, then one short example.
End with when you use it and one common pitfall.
STEPS — What happens step by step?
Before you speak the answer, walk the interviewer through these steps:
- 1HashMap treats a null
key as a special case and stores it in a dedicated bucket.
- 2Hashtable was written to
be synchronized and simply rejects nulls to avoid extra null checks inside locked code.
- 3ConcurrentHashMap also disallows nulls
because null would be ambiguous with a missing key during concurrent reads.
- 4Give an example
One tiny concrete case you can say aloud.
- 5Common mistake
What juniors usually get wrong.
- 6Close
When you pick this over the alternative.
EXAMPLE — See it in action
Here's a short line you can speak, broken into clear beats:
Note: Adapt this scaffold to your own project — keep it under 60–90 seconds.
Key takeaway
HashMap treats a null key as a special case and stores it in a dedicated bucket. Hashtable was written to be synchronized and simply rejects nulls to avoid extra null checks inside locked code.