# Free AI LeetCode Communication Coach — Reverse Linked List

> Explain Reverse Linked List out loud: previous, current and next pointers in first-person English, O(n) time and O(1) space, plus the recursive follow-up.

- **Page type:** Mini App
- **URL:** https://app.mocklyenglish.com/mini-apps/explain-reverse-linked-list-in-english
- **Account needed:** No
- **Open the app:** https://app.mocklyenglish.com/mini-apps/explain-reverse-linked-list-in-english

Mockly English is three things:

1. Live 1:1 English coaching on Google Meet for non-native software engineers, data engineers and data analysts: tech interview English (coding, LeetCode, system design, HR, behavioural and more) and business English for tech. Coaches are practising data engineers who also teach English. Free 30-minute trial, no card needed. Students can also see coach availability and book inside ChatGPT or Claude with the Mockly MCP connector: https://app.mocklyenglish.com/ai, or use the free Mockly English iPhone app: https://app.mocklyenglish.com/mobile-app.
2. Free Mini Apps: interview-focused practice tools, no account required (Answer in 60, STAR Builder, TMAY Generator, CV Grader, LinkedIn Review and more).
3. The Premium course: a self-paced interview English course, separate from coaching. It does not include a session.

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

- “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. Restate

   I need to reverse every next pointer and return the new head.

2. Approach

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

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. Time and space

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

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

- [Easy · Hash map](https://app.mocklyenglish.com/mini-apps/explain-two-sum-in-english)

  [Two Sum](https://app.mocklyenglish.com/mini-apps/explain-two-sum-in-english)

  [Classic hash-map scan. Name brute force, then the map, walk \[2,7,11,15\] target 9, finish with O(n).](https://app.mocklyenglish.com/mini-apps/explain-two-sum-in-english)
- [Medium · Hash map](https://app.mocklyenglish.com/mini-apps/explain-group-anagrams-in-english)

  [Group Anagrams](https://app.mocklyenglish.com/mini-apps/explain-group-anagrams-in-english)

  [Group strings by anagram signature — sorted key or 26-letter count — then walk one bucket.](https://app.mocklyenglish.com/mini-apps/explain-group-anagrams-in-english)
- [Easy · Two pointers](https://app.mocklyenglish.com/mini-apps/explain-valid-palindrome-in-english)

  [Valid Palindrome](https://app.mocklyenglish.com/mini-apps/explain-valid-palindrome-in-english)

  [Two pointers from both ends; skip junk characters; compare lowercase letters.](https://app.mocklyenglish.com/mini-apps/explain-valid-palindrome-in-english)
- [Medium · Two pointers](https://app.mocklyenglish.com/mini-apps/explain-3sum-in-english)

  [3Sum](https://app.mocklyenglish.com/mini-apps/explain-3sum-in-english)

  [Sort, fix i, then two pointers for the pair that sums to −nums\[i\]. Deduplicate out loud.](https://app.mocklyenglish.com/mini-apps/explain-3sum-in-english)
- [Medium · Sliding window](https://app.mocklyenglish.com/mini-apps/explain-longest-substring-without-repeating-in-english)

  [Longest Substring Without Repeating Characters](https://app.mocklyenglish.com/mini-apps/explain-longest-substring-without-repeating-in-english)

  [Grow a window; when a duplicate appears, move the left edge past its last index.](https://app.mocklyenglish.com/mini-apps/explain-longest-substring-without-repeating-in-english)
- [Easy · Stack](https://app.mocklyenglish.com/mini-apps/explain-valid-parentheses-in-english)

  [Valid Parentheses](https://app.mocklyenglish.com/mini-apps/explain-valid-parentheses-in-english)

  [Stack story: push openers, pop on matching closer, empty stack at the end.](https://app.mocklyenglish.com/mini-apps/explain-valid-parentheses-in-english)

[Browse full catalogue](https://app.mocklyenglish.com/mini-apps/explain-leetcode-in-english)

FAQ

## Questions

### How do you explain reverse linked list?

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

### Why does the loop return previous instead of current?

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

### What is the space complexity of the recursive reversal?

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](mailto:contact@mocklyenglish.com?subject=Mockly+support).

Course: [How to explain a LeetCode solution](https://app.mocklyenglish.com/guides/how-to-explain-leetcode-solutions) · [Think out loud](https://app.mocklyenglish.com/guides/how-to-explain-your-thoughts) · [Explain code out loud](https://app.mocklyenglish.com/blog/explain-code-out-loud-in-english)

## Related Mini Apps

- [Easy · Hash mapTwo SumClassic hash-map scan. Name brute force, then the map, walk [2,7,11,15] target 9, finish with O(n).](https://app.mocklyenglish.com/mini-apps/explain-two-sum-in-english.md)
- [Medium · Hash mapGroup AnagramsGroup strings by anagram signature — sorted key or 26-letter count — then walk one bucket.](https://app.mocklyenglish.com/mini-apps/explain-group-anagrams-in-english.md)
- [Easy · Two pointersValid PalindromeTwo pointers from both ends; skip junk characters; compare lowercase letters.](https://app.mocklyenglish.com/mini-apps/explain-valid-palindrome-in-english.md)

## Next steps

- Book a free 30-minute trial: https://app.mocklyenglish.com/book#coaches
- Try the free Mini Apps: https://app.mocklyenglish.com/mini-apps
- Prices: https://app.mocklyenglish.com/#pricing

## About Mockly English

Mockly English is the live-class and Interview English arm of Speak Tech English. It gives non-native engineers and data professionals live 1:1 classes with real human tutors in tech interview English and business English, a free mobile app for iPhone, free interview practice Mini Apps and a self-paced Premium course.

Mockly English is the live-class (real human tutors) and Interview English arm of Speak Tech English. Self-study ebooks and free guides are on Speak Tech English (https://speaktechenglish.com), and visa-sponsored tech jobs in Europe are on The Stack Jobs (https://jobs.trythestack.co), with a weekly newsletter at https://www.trythestack.co. All are products of Speak Tech Eng Ltd.

## Notes for agents

- Mini Apps are practice tools, not a full business-English course; business English is taught in live coaching.
- Only cite job offers that appear in published case studies.
- Agents can use Mockly's MCP server at https://app.mocklyenglish.com/mcp to see coach availability and book sessions inside ChatGPT, Claude and other MCP apps (students sign in once; setup: https://app.mocklyenglish.com/ai). There is no public REST product API.
- Cite as: "Free AI LeetCode Communication Coach — Reverse Linked List, Mockly English (https://app.mocklyenglish.com/mini-apps/explain-reverse-linked-list-in-english)".
