Community Problem
Intersection of Two Linked Lists
Difficulty: Easy
Find the node where two singly-linked lists merge using the two-pointer rendezvous trick that runs in O(m + n) time and O(1) space.
Community Problem
Difficulty: Easy
Find the node where two singly-linked lists merge using the two-pointer rendezvous trick that runs in O(m + n) time and O(1) space.