Easy · Hash map · spoken drill
Free AI LeetCode Communication Coach — Two Sum
Classic hash-map scan. Name brute force, then the map, walk [2,7,11,15] target 9, finish with O(n).
The problem
Given an array of integers nums and an integer target, return the indices of the two numbers that add up to target. Exactly one solution. You may not use the same element twice.
Example: nums = [2,7,11,15], target = 9 → [0,1]
Narrate brute force, then a hash map of values already seen.
seen = {}
for i, n in enumerate(nums):
need = target - n
if need in seen:
return [seen[need], i]
seen[n] = iHow to explain it
1. Restate
Say the problem in your own words.
One or two sentences. Show you understood the input, the output, and the goal — not that you memorised the prompt.
2. Approach
Name the method before you code.
Brute force first if you need it, then the structure you will use: hash map, two pointers, stack, binary search.
3. Example
Walk one concrete input.
Pick small numbers. Say what you store, what you compare, and what you return. Interviewers follow an example more easily than abstract talk.
4. Time and space
One sentence each.
After the example, before you claim you are done. “Time is O(n) because we scan once. Space is O(n) for the map.”
5. Edge cases
Name at least one unusual input.
Empty input, duplicates, already sorted, overflow. Invite a follow-up: “I would also check …”
- “Let me restate this.”
- “My first instinct is brute force, then I will optimise.”
- “I will keep a hash map of values I have already seen.”
- “Time is O(n). Space is O(n) for the map.”
Practise out loud
3 free scored runs left this hour.
Problem · Easy
Given an array of integers nums and an integer target, return the indices of the two numbers that add up to target. Exactly one solution. You may not use the same element twice.
Example: nums = [2,7,11,15], target = 9 → [0,1]
- 1Restate — Say the problem in your own words.
- 2Approach — Name the method before you code.
- 3Example — Walk one concrete input.
- 4Time and space — One sentence each.
- 5Edge cases — Name at least one unusual input.
Hit record. Short countdown, then 60–90 seconds. We score the five-step script — never pronunciation.
Recording needs Chrome or Edge. You can still type below.
Model spoken script (~75s)
1. Restate
Let me restate this. I have an array and a target. I need the two indices that add up to the target, and I cannot reuse the same index.
2. Approach
Brute force is check every pair — correct but O(n²). I will scan once and keep a hash map of values I have already seen.
3. Example
For example, nums are 2, 7, 11, 15 and target is 9. I see 2, store index 0. At 7 I need 2, the map has it, so I return 0 and 1.
4. Time and space
Time is O(n) because I scan once. Space is O(n) for the map.
5. Edge cases
I would also check the empty array and the case where the pair sits at the two ends.
How to explain Two Sum out loud, step by step
In one sentence: You get a list of numbers and a goal value, and you have to find the positions of the two different entries whose values add up to that goal.
What to say, in order
- “Let me make sure I understand: I return two indices, not two values, and I can't use the same position twice.”
- “The brute-force idea is to check every pair. That works, but it's quadratic, so I'd like to do better.”
- “For each number, the partner I need is the target minus that number — I'll call it the complement.”
- “I'll walk the array once and keep a hash map from each value I've already seen to its index.”
- “At each position I first look up the complement in the map. If it's there, I return the stored index and the current index.”
- “If it's not there, I add the current value and its index to the map and keep going.”
- “Checking before inserting is what stops me from pairing an element with itself, and it still handles duplicates like three plus three.”
Key English phrases for Two Sum
- complement
- — the value that would complete the pair: target minus the current number
- look up in constant time
- — a hash-map check that takes O(1) on average
- a single pass
- — you scan the array once from left to right
- value-to-index map
- — the map's key is the number, the value is where you saw it
- trade space for time
- — use extra memory (the map) to avoid the nested loop
How to say the time and space complexity
“Time is O(n), because I visit each element once and every map lookup is constant time on average. Space is O(n), because in the worst case the map stores almost every element before I find the pair.”
Say 'on average' for hash-map lookups — a careful interviewer may ask about the worst case with many collisions.
Communication mistakes on Two Sum
- Mistake: Saying 'I return the two numbers' when the task asks for their indices. Instead: Say 'I return the two indices' in your restatement so the interviewer hears you read the output correctly.
- Mistake: Describing the map vaguely: 'I put everything in a hash map.' Instead: Name the key and the value: 'The key is the number, the value is its index.'
- Mistake: Inserting first and checking second without explaining why it's safe. Instead: Say 'I check for the complement before I insert, so I never match an element with itself.'
- Mistake: Saying 'O of N' with no reason attached. Instead: Attach a 'because': 'O(n) because I scan once and each lookup is constant time.'
Likely follow-up questions
Interviewer: “What if the array were already sorted?”
You: “Then I'd use two pointers, one at each end. If the sum is too small I move the left pointer right; if it's too big I move the right pointer left. That's O(n) time and O(1) extra space.”
Interviewer: “Why not sort the array first and use two pointers anyway?”
You: “Sorting costs O(n log n) and it moves the elements, so I'd have to keep the original indices alongside the values. The hash map is simpler and faster here.”
Interviewer: “What if there might be no valid pair?”
You: “I'd agree on a return value with you first — for example an empty list — and return it after the loop finishes without a match.”
Common mistakes when explaining Two Sum
- Jumping to code without restating the pair-of-indices goal.
- Saying “hash map” without walking a concrete example.
- Forgetting space is O(n) for the map.
Other problems
Medium · Hash map
Group Anagrams
Group strings by anagram signature — sorted key or 26-letter count — then walk one bucket.
Easy · Two pointers
Valid Palindrome
Two pointers from both ends; skip junk characters; compare lowercase letters.
Medium · Two pointers
3Sum
Sort, fix i, then two pointers for the pair that sums to −nums[i]. Deduplicate out loud.
Medium · Sliding window
Longest Substring Without Repeating Characters
Grow a window; when a duplicate appears, move the left edge past its last index.
Easy · Stack
Valid Parentheses
Stack story: push openers, pop on matching closer, empty stack at the end.
Medium · Stack
Daily Temperatures
Monotonic stack of indices waiting for a warmer day; answer[i] is days to wait.
FAQ
Questions
More questions? Email us at contact@mocklyenglish.com.
Course: How to explain a LeetCode solution · Think out loud · Explain code out loud
Quick answer
Free AI LeetCode Communication Coach: restate, name the approach, walk an example, state time and space, then name an edge case. Record 60–90 seconds and get a scorecard on that structure — not on your accent.
Related in this path
People like you
Practise in the course
Think out loud in English