Linked List pattern

Linked List Cycle

Given the head of a singly linked list, determine whether the list contains a cycle, meaning some node can be reached again by repeatedly following next pointers. Watch it run step by step, then write your own pseudocode and get it checked by AI.

  • LeetCode 141
  • Easy
  • 2 approaches
Sign in to open it See plans

Sign in with Google or GitHub and you land straight on this page. DSA comes with the all labs plan and every ChaiCode batch.

Linked ListLeetCode 141

Easy

From the first idea to the best one

  1. 01 Brute force · visited set O(n)O(n) space
  2. 02 Optimized · Floyd's two-speed pointers O(n)O(1) space
Each approach plays step by step, with its time and space.

What you will learn

  • How to read Linked List Cycle and spot the linked list pattern in it
  • Brute force · visited set: O(n) time, O(n) space
  • Optimized · Floyd's two-speed pointers: O(n) time, O(1) space
  • The pseudocode for each approach, its line lit as the animation runs
  • Practice: write your own pseudocode and get it checked

More Linked List

See Linked List Cycle run, step by step

Sign in and this page opens on the animation, with all 9 Linked List problems beside it.

Sign in to open itSee plans

DSA comes with the all labs plan and every ChaiCode batch.