CareerCup

A little improvement in step 2

-Once we find the starting of the loop, we can just measure the length of the 2 lists till we encounter that specific node (the starting node, we don't need to enter the loop).
-Calculate diff = length1 - length2
-Move (diff) no. of nodes forward in the longer list.
-Start moving in both the lists, once they point to the same node, we have reached the merging node.

Please correct me if am wrong.

You (me as well) have assumed that lists merge before the cycle node. They could be merging after the cycle node.

Find the loop node, make it as the point of reference for the linked list length calculation, it would need 3 iterations totally, one to find if there's a loop in the list, 2nd to find the looping node, 3rd to find the intersection point

There can be 2 loop nodes.

thanks for test case, i missed it, in such case there should be a check if the loop nodes of both the linked lists are same, else the nodes don't intersect.

Sun only thing you need to do if the loop nodes are the same. If they are different than you have to calculate lengths seperately than apply the algorithm thats all. They can intersect still if the loop nodes are different.

It isn't possible? May be a drawing will make it clear. ww w.flashpaint.com/sketchit.php?id=14261

@ Rayden
The lists have to have a common tail. So, I agree with Ankur.

I did NOT say the loop nodes can be different. I simply stated that their loop "entry" nodes can be different.