Showing:
Handle Score
@Ibrahim Nash 6420
@mb1973 5578
@Quandray 5231
@akhayrutdinov 5111
@saiujwal13083 4510
@sanjay05 3762
@kirtidee18 3673
@marius_valentin_dragoi 3522
@sushant_a 3459
@verma_ji 3412
Intersection Point in Y Shapped Linked Lists
Medium Accuracy: 49.55% Submissions: 100k+ 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:

Input:
common = 15->30->NULL
Output: 15
Explanation:



Example 2:

Input:
common = 8->4->5->NULL
Output: 8
Explanation:

4              5
|              |
1              6
\             /
8   -----  1
|
4
|
5
|
NULL       

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)

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