Easy · Hash map · spoken drill

Free AI LeetCode Communication Coach — Contains Duplicate

Scan once into a set; if insert fails, a duplicate exists.

The problem

Return true if any value appears at least twice in the array.

Example: nums = [1,2,3,1] → true

Set membership is the whole story.

seen = set()
for n in nums:
    if n in seen:
        return True
    seen.add(n)
return False

How to explain it

  1. 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. 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. 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. 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. 5. Edge cases

    Name at least one unusual input.

    Empty input, duplicates, already sorted, overflow. Invite a follow-up: “I would also check …”

  • “I store values I have already seen.”
  • “If insert fails, it is a duplicate.”

Practise out loud

3 free scored runs left this hour.

Problem · Easy

Return true if any value appears at least twice in the array.

Example: nums = [1,2,3,1] → true

  1. 1Restate — Say the problem in your own words.
  2. 2Approach — Name the method before you code.
  3. 3Example — Walk one concrete input.
  4. 4Time and space — One sentence each.
  5. 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. 1. Restate

    I need to know if any number appears more than once.

  2. 2. Approach

    I scan once and store values in a hash set. If I see a value already in the set, I return true.

  3. 3. Example

    On 1,2,3,1 — when I see the second 1 the set already has it, so true.

  4. 4. Time and space

    Time is O(n). Space is O(n) for the set.

  5. 5. Edge cases

    I would check an empty array and an all-unique array.

How to explain Contains Duplicate out loud, step by step

In one sentence: You have to report whether any value shows up more than once in a list of numbers.

What to say, in order

  1. “I return true as soon as any value appears twice, and false if every value is distinct.”
  2. “Brute force compares every pair, which is O(n squared).”
  3. “Instead I'll keep a hash set of the values I've already seen.”
  4. “For each number, if it's already in the set, I return true immediately.”
  5. “Otherwise I add it and keep going. If I finish the loop, every value was unique, so I return false.”
  6. “If memory is tight, I can sort instead and check neighbouring values, trading time for space.”

Key English phrases for Contains Duplicate

hash set
— a collection with fast membership checks and no values attached
membership check
— asking 'have I seen this value?'
early exit / short-circuit
— return as soon as the answer is known
adjacent after sorting
— equal values end up next to each other
distinct
— all different

How to say the time and space complexity

“With the hash set, time is O(n) on average, because each lookup and insert is constant time on average, and space is O(n) for the set. With sorting, time is O(n log n), and extra space depends on the sort — it can be O(1) with an in-place sort like heapsort.”

Present it as a trade-off: 'faster with more memory, or slower with less.'

Communication mistakes on Contains Duplicate

  • Mistake: Saying 'hash map' when nothing is stored as a value. Instead: Say 'hash set' — it signals you picked the simplest structure.
  • Mistake: Building the full set first and comparing sizes, without mentioning early exit. Instead: Both are fine; say which you chose and that the loop version can stop early.
  • Mistake: Claiming sorting is O(1) space in every language. Instead: Say 'it depends on the sort; many built-in sorts use extra memory.'

Likely follow-up questions

  • Interviewer: “What if duplicates only count when they are at most k positions apart?”

    You: “I keep a sliding window set of the last k values. For each new value I check the set, add the value, and remove the one that just left the window. O(n) time, O(k) space.”

  • Interviewer: “What if you can't use extra memory?”

    You: “I'd sort in place and compare each element with the next one. That's O(n log n) time, and I'd mention that it changes the input order.”

Common mistakes when explaining Contains Duplicate

  • Only sorting without mentioning the space trade-off.
  • Not walking a small example.

Other problems

Browse full catalogue

FAQ

Questions

Hash set scan, O(n)/O(n). Mention sort trade-off if asked.

A hash set gives O(n) average time with O(n) space. Sorting gives O(n log n) time with little or no extra space if the sort is in place. Say the trade-off out loud.

Say 'As soon as I see a value that's already in the set, I return true — I don't need to scan the rest.'

More questions? Email us at contact@mocklyenglish.com.

Course: How to explain a LeetCode solution · Think out loud · Explain code out loud

For bots & AI agents

Machine-readable versions of this page and Mockly English. Mockly English, the live-class and Interview English arm of Speak Tech English, gives non-native engineers live 1:1 classes with real human tutors in tech interview and business English, plus a free iPhone app, free practice Mini Apps and a self-paced course. Fetch these instead of parsing this page.

This Mini App (.md)llms.txtllms-full.txtai.txtFact sheetFull catalog (.md)Endpoint indexAI catalogAgent skillsMCP serverMCP server cardAgent sign-in (auth.md)Sitemaprobots.txtUse Mockly in ChatGPT & ClaudeiPhone appDeveloper docsSpeak Tech English