Finding the intersecting node from two intersecting linked lists

Question

Suppose there are two singly linked lists both of which intersect at some point and become a single linked list.

The head or start pointers of both the lists are kno

Answer 1

Dump the contents (or address) of both lists into one hash table. first collision is your intersection.