Find a convergence point if any in given two linked lists.
Anonymous
Just traverse through both the lists once, say m and n are the length of the lists, get abs(m-n) say k, traverse k nodes in the bigger list, then keep on traversing one by one in both lists till a node matches. The first node that matches is the convergence point.
Check out your Company Bowl for anonymous work chats.