Linked Lists

Rewire next pointers in place, and use fast and slow pointers to find cycles and midpoints.

  1. 01

    Reverse a Linked List

    • easy
    • Pro
  2. 02

    Merge Two Sorted Lists

    • easy
    • Pro
  3. 03

    Detect a Cycle

    • easy
    • Pro
  4. 04

    Find the Middle Node

    • easy
    • Pro
  5. 05

    Remove the Nth Node from the End

    • medium
    • Pro
  6. 06

    Add Two Numbers

    • medium
    • Pro
  7. 07

    Copy a List with Random Pointers

    • medium
    • Pro
  8. 08

    Build an LRU Cache

    • medium
    • Pro
  9. 09

    Reverse in Groups of K

    • hard
    • Pro