Search⌘ K
AI Features
Home
Courses
Grokking the Coding Interview Patterns

Solution: Intersection of Two Linked Lists

Understand how to identify the intersection node of two singly linked lists using a two-pointer approach that equalizes traversal paths. This lesson teaches you to detect shared nodes efficiently without extra space, achieving optimal time complexity.

We'll cover the following...

Statement

You are given the heads of two singly linked lists, headA and headB, to determine whether the two lists intersect. If they intersect, return the node where the intersection begins. Otherwise, return NULL.

Note: Linked lists intersect if they share a common node in memory, not just a node with the same value.

Constraints:

  • 1≤1 ≤ node.val ≤105≤ 10^5

  • The number of nodes of listAlistA is in the mm ...