Concept questionMedium~7 minC# OOP & Type Design Essentials / 14 of 15

Interview question

How do Equals and GetHashCode work together in C#, and what changes when you use a record as a dictionary key?

Equality, GetHashCode, records, and dictionary keys

Connects equality semantics to hash-based collections and chooses identity or value equality deliberately.

1Say itAnswer out loud first

2CompareCompare with Core answer

3RefineRefine with Stronger and Advanced

TL;DR

If two values are equal according to Equals, they must return the same hash code during the time they are used in a hash-based collection. Unequal values may share a hash code, so the collection still uses equality to resolve collisions. Classes use reference identity by default unless they override equality, while records generate value-based equality from their components. For a dictionary key I want equality to represent the key's real identity and every participating value to remain stable after insertion.

Full answer below

Practice focus

Reference and value equality, equality contracts, hash stability, records, custom comparers, and dictionary correctness.

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
Equality is not only about whether two comparisons return true. Hash-based collections depend on a stable contract, so a poor equality design can make an existing key appear to disappear.
If two values are equal according to Equals, they must return the same hash code during the time they are used in a hash-based collection. Unequal values may share a hash code, so the collection still uses equality to resolve collisions. Classes use reference identity by default unless they override equality, while records generate value-based equality from their components. For a dictionary key I want equality to represent the key's real identity and every participating value to remain stable after insertion.
Checkpoint
Stronger answer
Optional upgrade with examples, trade-offs, and sharper phrasing.
A record CustomerKey(Guid TenantId, string ExternalId) is a good key because its components describe identity and are immutable. A mutable record or class whose hash includes ExternalId is dangerous if that property changes after insertion: the dictionary looks in a different bucket and may not find the same object. When equality rules are context-specific, such as case-insensitive external IDs, I would pass an IEqualityComparer<T> instead of changing global equality for every use. I would also keep database identity and domain value equality conceptually separate.
Finish
Advanced answer
Optional deeper angle for production judgment and nuance.
For a custom equality implementation I would preserve reflexivity, symmetry, transitivity, null behavior, and consistency with GetHashCode, and I would use the same significant fields in both methods. Record inheritance needs care because generated equality includes runtime type semantics; two different record types with matching components are not automatically interchangeable. Hash codes are process-oriented implementation details and should not be persisted as durable identifiers. In production I would test equal pairs, unequal collisions, comparer behavior, and mutation after insertion. If key data must change, I would remove and reinsert it or use an immutable key object rather than hoping the collection repairs itself.

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 overriding GetHashCode consistently.
Using mutable properties in the hash of a dictionary key.
Persisting a runtime hash code as a durable external identifier.
Assuming records are suitable keys without checking which components define equality.

Red flagsCandidateSigns the approach is fragileSignals that an interviewer may treat as risky.Open details

Details

Says equal objects may freely have different hash codes.
Cannot explain why mutating a key can make lookup fail.
Uses reference identity where the domain expects a value key, or the reverse.
Changes global equality to solve one collection's comparison rule.

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.

Can unequal values have the same hash code?
When would you pass a custom equality comparer?
How does record equality behave across an inheritance hierarchy?

Continue the section

Next in C# OOP & Type Design Essentials: Object collaboration

Step 15 of 15

Tell, don't ask and practical object collaboration

Opening drill

Concept questionMedium~7 minC# OOP & Type Design Essentials / 14 of 15

Interview question

How do Equals and GetHashCode work together in C#, and what changes when you use a record as a dictionary key?

Equality, GetHashCode, records, and dictionary keys

Connects equality semantics to hash-based collections and chooses identity or value equality deliberately.

1Say itAnswer out loud first

2CompareCompare with Core answer

3RefineRefine with Stronger and Advanced

TL;DR

Full answer below

Practice focus

Reference and value equality, equality contracts, hash stability, records, custom comparers, and dictionary correctness.

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
Equality is not only about whether two comparisons return true. Hash-based collections depend on a stable contract, so a poor equality design can make an existing key appear to disappear.
If two values are equal according to Equals, they must return the same hash code during the time they are used in a hash-based collection. Unequal values may share a hash code, so the collection still uses equality to resolve collisions. Classes use reference identity by default unless they override equality, while records generate value-based equality from their components. For a dictionary key I want equality to represent the key's real identity and every participating value to remain stable after insertion.
Checkpoint
Stronger answer
Optional upgrade with examples, trade-offs, and sharper phrasing.
A record CustomerKey(Guid TenantId, string ExternalId) is a good key because its components describe identity and are immutable. A mutable record or class whose hash includes ExternalId is dangerous if that property changes after insertion: the dictionary looks in a different bucket and may not find the same object. When equality rules are context-specific, such as case-insensitive external IDs, I would pass an IEqualityComparer<T> instead of changing global equality for every use. I would also keep database identity and domain value equality conceptually separate.
Finish
Advanced answer
Optional deeper angle for production judgment and nuance.
For a custom equality implementation I would preserve reflexivity, symmetry, transitivity, null behavior, and consistency with GetHashCode, and I would use the same significant fields in both methods. Record inheritance needs care because generated equality includes runtime type semantics; two different record types with matching components are not automatically interchangeable. Hash codes are process-oriented implementation details and should not be persisted as durable identifiers. In production I would test equal pairs, unequal collisions, comparer behavior, and mutation after insertion. If key data must change, I would remove and reinsert it or use an immutable key object rather than hoping the collection repairs itself.

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 overriding GetHashCode consistently.
Using mutable properties in the hash of a dictionary key.
Persisting a runtime hash code as a durable external identifier.
Assuming records are suitable keys without checking which components define equality.

Red flagsCandidateSigns the approach is fragileSignals that an interviewer may treat as risky.Open details

Details

Says equal objects may freely have different hash codes.
Cannot explain why mutating a key can make lookup fail.
Uses reference identity where the domain expects a value key, or the reverse.
Changes global equality to solve one collection's comparison rule.

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.

Can unequal values have the same hash code?
When would you pass a custom equality comparer?
How does record equality behave across an inheritance hierarchy?

Continue the section

Next in C# OOP & Type Design Essentials: Object collaboration

Step 15 of 15

Tell, don't ask and practical object collaboration

How do Equals and GetHashCode work together in C#, and what changes when you use a record as a dictionary key?

Practice focus

Answer path

Why this question matters

Review signals

Follow-up prompts

Continue the section

How do Equals and GetHashCode work together in C#, and what changes when you use a record as a dictionary key?

Practice focus

Answer path

Why this question matters

Review signals

Follow-up prompts

Continue the section