What is the difference between `WeakHashMap` and a regular `HashMap` with `WeakReference` values?

Explanation

WeakHashMap uses weak references for keys, automatically removing entries when keys are garbage collected. In contrast, a regular HashMap with WeakReference values keeps the key alive but allows the value to be collected.

Key points

WeakHashMap removes entries when keys are garbage collected
Regular HashMap with WeakReference values keeps keys alive
Key distinction: automatic entry removal in WeakHashMap

Ready to go further?

Start full exam Practice more questions