Given the heads of two singly linked lists, return the node where the two lists intersect. Return null if no intersection.
listA: a1→a2→c1→c2→c3 listB: b1→b2→b3→c1→c2→c3 Output: c1 (intersection node)
Unlock hints progressively — start gentle, go deeper only if needed.
Level 1: Gentle Nudge
A subtle direction
Level 2: Approach
The algorithm to use
Level 3: Detailed
Step-by-step guidance
to save progress and use AI features