Given two LinkedLists that eventually merge into one, determine the node where they merge.
Sigiloso
I will say that the answer depends on several factors. If the numbers in the linked list are in sorted or ascending order than the first element of the linked list will determine the node. It also depends on how you are adding the two linked list. If you are adding the linked list at the end of the other linked list then you traverse through the first linked list. You can also use a hashing function to determine the index where a specific element will go.