Easy · Linked list · spoken drill

Free AI LeetCode Communication Coach — Reverse Linked List

Iteratively reverse pointers with prev/curr/next — or recurse and narrate the unwind.

The problem

Given the head of a singly linked list, reverse the list and return the new head.

Example: 1 → 2 → 3 → 4 → 5 → 5 → 4 → 3 → 2 → 1

Say you save next before rewiring.

prev = None
curr = head
while curr:
    nxt = curr.next
    curr.next = prev
    prev = curr
    curr = nxt
return prev

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 keep prev, curr, and next.”
  • “I reverse the link before I move forward.”

Practise out loud

3 free scored runs left this hour.

Problem · Easy

Given the head of a singly linked list, reverse the list and return the new head.

Example: 1 → 2 → 3 → 4 → 5 → 5 → 4 → 3 → 2 → 1

  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 reverse every next pointer and return the new head.

  2. 2. Approach

    I will iterate with three pointers: previous, current, and next. I reverse the link, then advance.

  3. 3. Example

    On 1→2→3, I reverse 1 to null, then 2 to 1, then 3 to 2. The new head is 3.

  4. 4. Time and space

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

  5. 5. Edge cases

    I would check null head and a single-node list.

How to explain Reverse Linked List out loud, step by step

In one sentence: You have a singly linked list and must flip the direction of every link so that the last node becomes the new head.

What to say, in order

  1. “I'll reverse the pointers in place, one node at a time, using three references: previous, current and next.”
  2. “Previous starts as null, because the old head will become the tail. Current starts at the head.”
  3. “In each step I first save current's next node, so I don't lose the rest of the list.”
  4. “Then I point current's next back to previous.”
  5. “Then I move previous up to current, and current up to the saved next node.”
  6. “When current becomes null, previous is the new head, so I return previous.”

Key English phrases for Reverse Linked List

node / next pointer
— the element and its link to the following element
save the next node
— store it before you overwrite the link
rewire the link
— change where a node's next pointer points
in place
— no new nodes are created
the new head
— the node you return at the end

How to say the time and space complexity

“Time is O(n), because I visit each node exactly once. Space is O(1), because I only use three pointers no matter how long the list is.”

If the interviewer asks for the recursive version, say its space is O(n) because of the call stack.

Communication mistakes on Reverse Linked List

  • Mistake: Saying 'I swap the nodes' — you don't move nodes, you change links. Instead: Say 'I reverse the next pointers.'
  • Mistake: Listing the three assignments in the wrong order out loud. Instead: Use a fixed rhythm: 'save next, point back, move previous, move current.'
  • Mistake: Returning 'the head' at the end. Instead: Say clearly 'I return previous, which is the new head.'

Likely follow-up questions

  • Interviewer: “Can you do it recursively?”

    You: “Yes. I reverse the rest of the list starting from head.next, then set head.next.next to head and head.next to null, and return the new head from the recursive call. It's O(n) time but O(n) stack space.”

  • Interviewer: “How would you reverse only the part between two positions?”

    You: “I walk to the node before the left position, reverse exactly right minus left plus one nodes with the same three-pointer loop, then reconnect both ends. A dummy node in front of the head makes the edge case at position one easier.”

Common mistakes when explaining Reverse Linked List

  • Losing the next pointer before rewiring.
  • Forgetting to return the new head (old tail).

Other problems

Browse full catalogue

FAQ

Questions

Three pointers, rewire, O(1) space. Return prev.

The loop stops when current is null. At that moment previous points to the last node you processed, which is the new head.

O(n), because each node adds a frame to the call stack. The iterative version uses O(1) extra space.

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