Concept questionEasy~5 min.NET Collections & LINQ Essentials / 2 of 15

Interview question

How do Dictionary<TKey,TValue> and HashSet<T> work, and what equality rules do their keys require?

Dictionary and HashSet hashing and equality in C#

Explains how hash-based collections use hash codes and equality, then chooses Dictionary or HashSet from the value the program needs to store.

1Say itAnswer out loud first

2CompareCompare with Core answer

3RefineRefine with Stronger and Advanced

TL;DR

Dictionary and HashSet are hash-based collections. A dictionary maps a unique key to a value, while a hash set stores unique values and answers membership questions. Both use a hash code to narrow the search and equality to confirm a match. Different values can share a hash code, so the collection still needs equality after finding the bucket.

Full answer below

Practice focus

Hash buckets, equality, comparers, unique keys, set membership, mutable keys, collisions, and average versus worst-case behavior.

Answer first

Answer path

Core answer first, then checkpoints toward a stronger answer.

Start
Core answer
Start here. This is the direct spoken answer to practice first.
Why this question matters
Hash-based collections are everyday tools whose correctness depends on an equality contract that is easy to violate silently.
Dictionary and HashSet are hash-based collections. A dictionary maps a unique key to a value, while a hash set stores unique values and answers membership questions. Both use a hash code to narrow the search and equality to confirm a match. Different values can share a hash code, so the collection still needs equality after finding the bucket.
Checkpoint
Stronger answer
Optional upgrade with examples, trade-offs, and sharper phrasing.
A value that compares equal must return the same hash code for as long as it is stored. I avoid mutating fields that participate in key equality because the object may then live in the wrong bucket and become impossible to find normally. I choose an explicit comparer when equality is domain-specific, such as case-insensitive product codes. Lookup, insertion, and removal are usually O(1) on average, but collisions and resizing still have costs.
Finish
Advanced answer
Optional deeper angle for production judgment and nuance.
In production I make key semantics part of the model rather than an incidental collection option. Stable value objects, normalized identifiers, or an explicit IEqualityComparer<T> make intent reviewable and testable. I size large dictionaries when estimates are reliable, but I do not trade correctness for speculative capacity tuning. For untrusted high-volume input I consider maximum item counts and collision behavior as part of resource protection. I also distinguish identity from presentation: culture-sensitive string comparison may be correct for display sorting but unsafe for protocol keys. Tests cover equal values, unequal values, case rules, null policy where supported, and key stability across serialization or process boundaries.

Review signals

Use these to catch weak phrasing, shallow reasoning, and risky claims.

Common mistakesCandidateCommon mistakesMistakes that weaken the answer or signal shallow understanding.Open details

Details

Overriding Equals without a consistent GetHashCode.
Mutating a key after insertion.
Using Dictionary when only uniqueness is needed.
Relying on default string comparison without deciding the semantics.

Red flagsCandidateSigns the collection reasoning is weakSignals that an interviewer may treat as risky.Open details

Details

Cannot explain why both hashing and equality are needed.
Treats average O(1) as a guarantee.
Uses display labels as unstable identifiers.
No explicit rule for duplicate input.

Follow-up prompts

Quick interviewer prompts inside this drill.

Follow-up questionsCandidateFollow-up questionsLikely next questions after the main answer.Open details

Details

Treat these as the next interviewer turn. Answer one out loud, then save the gap in your practice notes.

What happens when two keys have the same hash code?
Why are mutable keys dangerous?
When would you inject an IEqualityComparer<T>?

Continue the section

Next in .NET Collections & LINQ Essentials: Collection complexity

Step 3 of 15

Collection operation complexity and real runtime costs

Opening drill

Concept questionEasy~5 min.NET Collections & LINQ Essentials / 2 of 15

Interview question

How do Dictionary<TKey,TValue> and HashSet<T> work, and what equality rules do their keys require?

Dictionary and HashSet hashing and equality in C#

Explains how hash-based collections use hash codes and equality, then chooses Dictionary or HashSet from the value the program needs to store.

1Say itAnswer out loud first

2CompareCompare with Core answer

3RefineRefine with Stronger and Advanced

TL;DR

Full answer below

Practice focus

Hash buckets, equality, comparers, unique keys, set membership, mutable keys, collisions, and average versus worst-case behavior.

Answer first

Answer path

Core answer first, then checkpoints toward a stronger answer.

Start
Core answer
Start here. This is the direct spoken answer to practice first.
Why this question matters
Hash-based collections are everyday tools whose correctness depends on an equality contract that is easy to violate silently.
Dictionary and HashSet are hash-based collections. A dictionary maps a unique key to a value, while a hash set stores unique values and answers membership questions. Both use a hash code to narrow the search and equality to confirm a match. Different values can share a hash code, so the collection still needs equality after finding the bucket.
Checkpoint
Stronger answer
Optional upgrade with examples, trade-offs, and sharper phrasing.
A value that compares equal must return the same hash code for as long as it is stored. I avoid mutating fields that participate in key equality because the object may then live in the wrong bucket and become impossible to find normally. I choose an explicit comparer when equality is domain-specific, such as case-insensitive product codes. Lookup, insertion, and removal are usually O(1) on average, but collisions and resizing still have costs.
Finish
Advanced answer
Optional deeper angle for production judgment and nuance.
In production I make key semantics part of the model rather than an incidental collection option. Stable value objects, normalized identifiers, or an explicit IEqualityComparer<T> make intent reviewable and testable. I size large dictionaries when estimates are reliable, but I do not trade correctness for speculative capacity tuning. For untrusted high-volume input I consider maximum item counts and collision behavior as part of resource protection. I also distinguish identity from presentation: culture-sensitive string comparison may be correct for display sorting but unsafe for protocol keys. Tests cover equal values, unequal values, case rules, null policy where supported, and key stability across serialization or process boundaries.

Review signals

Use these to catch weak phrasing, shallow reasoning, and risky claims.

Common mistakesCandidateCommon mistakesMistakes that weaken the answer or signal shallow understanding.Open details

Details

Overriding Equals without a consistent GetHashCode.
Mutating a key after insertion.
Using Dictionary when only uniqueness is needed.
Relying on default string comparison without deciding the semantics.

Red flagsCandidateSigns the collection reasoning is weakSignals that an interviewer may treat as risky.Open details

Details

Cannot explain why both hashing and equality are needed.
Treats average O(1) as a guarantee.
Uses display labels as unstable identifiers.
No explicit rule for duplicate input.

Follow-up prompts

Quick interviewer prompts inside this drill.

Follow-up questionsCandidateFollow-up questionsLikely next questions after the main answer.Open details

Details

Treat these as the next interviewer turn. Answer one out loud, then save the gap in your practice notes.

What happens when two keys have the same hash code?
Why are mutable keys dangerous?
When would you inject an IEqualityComparer<T>?

Continue the section

Next in .NET Collections & LINQ Essentials: Collection complexity

Step 3 of 15

Collection operation complexity and real runtime costs

How do Dictionary<TKey,TValue> and HashSet<T> work, and what equality rules do their keys require?

Practice focus

Answer path

Why this question matters

Review signals

Follow-up prompts

Continue the section

How do Dictionary<TKey,TValue> and HashSet<T> work, and what equality rules do their keys require?

Practice focus

Answer path

Why this question matters

Review signals

Follow-up prompts

Continue the section