How do you find two numbers that sum to a target?
PICTURE THIS: HASH MAP
Simple meaning
I scan once and store seen values in a hash set or map.
WHY — Hashing instead of guessing?
Why interviewers care about Hashing:
question about Hashing.
trade-offs, and what you would actually do on a DSA project - not buzzwords.
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:
- 1I scan once and
store seen values in a hash set or map.
- 2For each number I
check if target minus number was seen.
- 3That is O(n) average
time versus O(n^2) nested loops.
- 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
I scan once and store seen values in a hash set or map. For each number I check if target minus number was seen.