Intersection Point in Y Shapped Linked Lists
Medium Accuracy: 49.55% Submissions: 89056 Points: 4

Given two singly linked lists of size N and M, write a program to get the point where two linked lists intersect each other.


Example 1:

LinkList1 = 3->6->9->common
LinkList2 = 10->common
common = 15->30->NULL
Output: 15
Y ShapedLinked List


Your Task:
You don't need to read input or print anything. The task is to complete the function intersetPoint() which takes the pointer to the head of linklist1(head1) and linklist2(head2) as input parameters and returns data value of a node where two linked lists intersect. If linked list do not merge at any point, then it should return -1.

Challenge : Try to solve the problem without using any extra space.


Expected Time Complexity: O(N+M)
Expected Auxiliary Space: O(1)


1 ≤ N + M ≤ 2*105
-1000 ≤ value ≤ 1000


to report an issue on this page.


We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?


All Submissions

My Submissions:

Login to access your submissions.

Intersection Point in Y Shapped Linked Lists

Output Window