Easy · Linked list · spoken drill

Free AI LeetCode Communication Coach — Linked List Cycle

Slow moves one, fast moves two; if they meet there is a cycle.

The problem

Given head, return true if the linked list has a cycle.

Example: list with a cycle back to an earlier node → true

Name tortoise and hare.

slow = fast = head
while fast and fast.next:
    slow = slow.next
    fast = fast.next.next
    if slow is fast:
        return True
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 …”

  • “Slow moves one, fast moves two.”
  • “If they meet, there is a cycle.”

Practise out loud

3 free scored runs left this hour.

Problem · Easy

Given head, return true if the linked list has a cycle.

Example: list with a cycle back to an earlier node → 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 following next pointers can loop forever.

  2. 2. Approach

    I use two pointers. Slow moves one step, fast moves two. If they meet, there is a cycle. If fast hits null, there is not.

  3. 3. Example

    If a node points back earlier, fast laps slow inside the loop and they collide.

  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 with no self-loop.

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

In one sentence: You have to tell whether following the next links of a linked list ever brings you back to a node you've already passed, instead of reaching the end.

What to say, in order

  1. “If there's no cycle, following next pointers eventually reaches null. If there is a cycle, I loop forever, so I need a different stopping rule.”
  2. “A simple option is a hash set of visited nodes, but that costs O(n) space.”
  3. “I'll use Floyd's algorithm with two pointers: slow moves one node at a time, fast moves two.”
  4. “If fast or fast's next becomes null, there's an end to the list, so there's no cycle.”
  5. “If there is a cycle, fast enters it and gains one node on slow at every step, so they must meet. When they point to the same node, I return true.”

Key English phrases for Linked List Cycle

tortoise and hare
— the nickname for the slow and fast pointers
the pointers meet
— both reference the same node
close the gap by one
— fast gains one node on slow per step inside the cycle
node identity
— compare the nodes themselves, not their values
null check
— making sure fast and fast.next exist before moving

How to say the time and space complexity

“Time is O(n), because slow enters the cycle within n steps, and then fast catches it within the length of the cycle. Space is O(1), because I only use two pointers.”

Contrast it with the hash set version — O(n) time, O(n) space — in one sentence.

Communication mistakes on Linked List Cycle

  • Mistake: Comparing node values instead of node references. Instead: Say 'I check whether they're the same node', because different nodes can share a value.
  • Mistake: Not explaining why the pointers must meet. Instead: Say 'inside the cycle, fast gains one step per move, so the gap shrinks to zero.'
  • Mistake: Forgetting to check fast.next before moving two steps. Instead: Say the loop condition out loud: 'while fast and fast.next are not null.'

Likely follow-up questions

  • Interviewer: “How do you find the node where the cycle begins?”

    You: “After slow and fast meet, I move one pointer back to the head. Then I move both one step at a time; the node where they meet again is the start of the cycle.”

  • Interviewer: “How would you find the length of the cycle?”

    You: “From the meeting point, I keep one pointer still and move the other one step at a time, counting until it comes back. That count is the cycle length.”

Common mistakes when explaining Linked List Cycle

  • Not explaining why meeting implies a cycle.
  • Null-checking only slow, not fast.next.

Other problems

Browse full catalogue

FAQ

Questions

Floyd slow/fast pointers, O(1) space.

It stores only two pointers, no matter how long the list is, instead of remembering every visited node.

Yes, it's correct and O(n) time, but it uses O(n) space. Mention it as the simple option, then give the two-pointer version.

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 gives non-native engineers live 1:1 coaching in tech interview and business English, plus 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 indexUse Mockly in ChatGPT & ClaudeDeveloper docsSpeak Tech English