Easy · Binary search · spoken drill

Free AI LeetCode Communication Coach — Binary Search

Sorted array: left, right, mid — discard the half that cannot contain the target.

The problem

Given a sorted ascending array and a target, return the index or -1. Aim for O(log n).

Example: nums = [1,3,5,7,9], target = 7 → 3

Say the discard line every time.

left, right = 0, len(nums) - 1
while left <= right:
    mid = (left + right) // 2
    if nums[mid] == target:
        return mid
    if nums[mid] < target:
        left = mid + 1
    else:
        right = mid - 1
return -1

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 …”

  • “Because the array is sorted I can discard half each step.”
  • “If the mid is too small, I move left up.”

Practise out loud

3 free scored runs left this hour.

Problem · Easy

Given a sorted ascending array and a target, return the index or -1. Aim for O(log n).

Example: nums = [1,3,5,7,9], target = 7 → 3

  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

    The array is sorted. I need the index of the target, or minus one.

  2. 2. Approach

    Because it is sorted I can binary search. I keep left and right, look at mid, and discard the half that cannot contain the target.

  3. 3. Example

    On 1,3,5,7,9 target 7 — mid is 5, too small, so I search the right half and then hit 7.

  4. 4. Time and space

    Time is O(log n). Space is O(1).

  5. 5. Edge cases

    I would check an empty array and a target smaller than the first element.

How to explain Binary Search out loud, step by step

In one sentence: You have a sorted list and a value, and you must return where that value sits in the list, or minus one if it isn't there, in logarithmic time.

What to say, in order

  1. “The array is sorted in ascending order, so I can discard half of the remaining range after every comparison.”
  2. “I keep two indices, low and high, and I treat the range as inclusive on both ends.”
  3. “While low is less than or equal to high, I compute mid as low plus half the distance to high.”
  4. “If the value at mid equals the target, I return mid.”
  5. “If it's smaller than the target, the answer can only be to the right, so low becomes mid plus one. Otherwise high becomes mid minus one.”
  6. “If the loop ends, the range is empty and the target isn't there, so I return minus one.”

Key English phrases for Binary Search

search space
— the range of indices that could still hold the answer
halve the search space
— what each comparison achieves
inclusive bounds
— both low and high are valid candidates
midpoint
— low + (high - low) / 2, rounded down
off-by-one error
— the classic bug in binary search loop conditions

How to say the time and space complexity

“Time is O(log n), because each step cuts the remaining range in half, so I need about log base two of n steps. Space is O(1) for the iterative version.”

If you write it recursively, say the space is O(log n) for the call stack.

Communication mistakes on Binary Search

  • Mistake: Not saying whether the bounds are inclusive, then mixing 'less than' and 'less than or equal'. Instead: Declare it: 'I'll keep both ends inclusive, so the loop runs while low is less than or equal to high.'
  • Mistake: Saying 'mid is low plus high over two' with no comment. Instead: Add 'I write it as low plus (high minus low) over two to avoid overflow in fixed-width integers.'
  • Mistake: Saying 'log n' without explaining where the log comes from. Instead: Say 'because the range halves each time.'

Likely follow-up questions

  • Interviewer: “How do you find the first position of the target when there are duplicates?”

    You: “When I find the target, I don't return. I record mid as a candidate and continue searching the left half with high equal to mid minus one. That's still O(log n).”

  • Interviewer: “What if the target isn't there and you need where it would be inserted?”

    You: “I run the same loop; when it ends, low is the insertion point, because it's the first index whose value is greater than the target.”

Common mistakes when explaining Binary Search

  • Skipping the “I discard this half” sentence.
  • Off-by-one on left/right without narrating the loop invariant.

Other problems

Browse full catalogue

FAQ

Questions

Sorted → discard half. Narrate left, mid, right. O(log n).

In languages with fixed-width integers, low + high can overflow for very large arrays. Subtracting first keeps the value in range and gives the same midpoint.

O(1) for the iterative version and O(log n) for a recursive version, because of the call stack.

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.

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