AlgoFoxGet AlgoFox App

CoursesDSA Foundations

Linked Lists

Lessons
9
Exercises
57
Minutes
67

Start Nodes & Traversal

  1. 1

    Nodes & Traversal

    A node holds a value and a link to the next node; walk the list until null.

    Complete codeDebugCode orderMultiple choiceTapTrace
    6 exercises
    6 min
  2. 2

    Insert & Delete

    Rewire next pointers to insert or remove a node in constant time.

    Complete codeDebugCode orderMultiple choiceTapTrace
    6 exercises
    7 min
  3. 3

    Linked List Basics CheckpointCheckpoint

    Prove you can traverse and rewire a linked list before tackling pointer tricks.

    Complete codeDebugCode orderFill blankMultiple choiceTapTrace
    7 exercises
    8 min
  4. 4

    Reverse a Linked List

    Flip every next pointer in one pass using prev, curr, and a saved next.

    Complete codeDebugCode orderMultiple choiceTrace
    6 exercises
    7 min
  5. 5

    Find the Middle

    Advance a slow pointer by one and a fast pointer by two to land on the middle.

    Complete codeDebugMultiple choiceTapTrace
    6 exercises
    7 min
  6. 6

    Cycle Detection

    Detect a loop with Floyd's fast and slow pointers, in constant space.

    Complete codeDebugFill blankMultiple choiceTrace
    6 exercises
    7 min
  7. 7

    Merge Two Sorted Lists

    Weave two sorted lists into one by always attaching the smaller current node.

    Complete codeDebugCode orderMultiple choiceTapTrace
    6 exercises
    7 min
  8. 8

    Linked Lists ReviewReview

    Revisit the trickiest ideas: saving next before rewiring, fast/slow guards, and merging.

    Complete codeDebugFill blankMultiple choiceTapTrace
    6 exercises
    8 min
  9. 9

    Boss: Reverse a Linked ListBoss

    Build the complete iterative reversal, pointer by pointer.

    Complete codeDebugCode orderMultiple choiceTrace
    8 exercises
    10 min