Find the intersection of two linked list.
Anonymous
iterate one list at a time until iterator1->next next 0 , this works also to find a loop in a linked list instead of the turtle and rabbit algorithm.
Check out your Company Bowl for anonymous work chats.