Based on your experience, what's the best way to find a node that begins with two single link lists?

You will find that Google interviewers like to ask candidates about the various methods they use to find nodes and link lists. Don't be surprised if this question comes up a couple of times in an interview but is asked differently. To get a broader understanding of linked lists, here's an overview: A linked list is easiest explained as a linear data structure with the collection of multiple nodes, where each element stores its data and a pointer to the location of the next element. The last link is essentially a linked list that points to null, which indicates it's at the end of a chain. An element, on the other hand, in a linked list is called a node. The first of the nodes is called the head, and the last of the nodes is called the tail. An interviewer will likely dig into questions about linear data structure and which nodes contain a value and pointer.