Question: Given two linked list head-pointer and they meet at some point and need to find the point of intersection. However, in place of the end
Given two linked list head-pointer and they meet at some point and need to find the point of intersection. However, in place of the end of both the linked list to be a null pointer there is a loop.

Step by Step Solution
3.36 Rating (149 Votes )
There are 3 Steps involved in it
Step solution to the problem Each of the lists is carrying a loop and has a tail section Floyds algorithm determines by a slow and a fast pointers whe... View full answer
Get step-by-step solutions from verified subject matter experts
