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 prevHow 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
- 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
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
- “I'll reverse the pointers in place, one node at a time, using three references: previous, current and next.”
- “Previous starts as null, because the old head will become the tail. Current starts at the head.”
- “In each step I first save current's next node, so I don't lose the rest of the list.”
- “Then I point current's next back to previous.”
- “Then I move previous up to current, and current up to the saved next node.”
- “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
Two Sum
Classic hash-map scan. Name brute force, then the map, walk [2,7,11,15] target 9, finish with O(n).
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.
FAQ
Questions
More questions? Email us at contact@mocklyenglish.com.
Course: How to explain a LeetCode solution · Think out loud · Explain code out loud