Intersection of Two Linked Lists

Asked in the Phone Screen 1 stage. LeetCode problem linked by the candidate.

Input and Output

The function receives two lists of node identifiers, headA and headB. Each list represents a linked-list path. Identical identifiers represent the same node, and an intersection means both lists share the same suffix from that node onward. Return the identifier of the first shared node, or None if the lists do not intersect.

Constraints

0 <= len(headA), len(headB) <= 10^4
Identifiers are strings, numbers, or other equality-comparable JSON values
Identifiers are unique within each individual list
If an intersection exists, it is represented by a common suffix

Function Signature

def get_intersection_node(headA, headB):

Your question is Intersection of Two Linked Lists. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem