Given two singly linked lists of size N and M, write a program to get the point where two linked lists intersect each other.
Above diagram shows an example with two linked list having 15 as intersection point.
Example 1:
Input:
LinkList1 = {10,20,5,10}
LinkList2 = {30,40,50,5,10}
Output: 5
Explanation:The point of intersection of
two linked list is 5, means both of them
get linked (intersects) with each other
at node whose value is 5.
Your Task:
The task is to complete the function intersetPoint() which finds the point of intersection of two linked list. The function should return data value of a node where two linked lists merge. 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 <= 100
1 <= value <= 1000
If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.
| saiujwal13083 | 269 |
| ppsvikhyat17 | 248 |
| vt9941 | 216 |
| generic_coder | 192 |
| balaji22 | 191 |
| saiujwal13083 | 528 |
| ppsvikhyat17 | 436 |
| generic_coder | 424 |
| vt9941 | 340 |
| SourabhPatel | 288 |
| blackshadows | 5444 |
| Ibrahim Nash | 5438 |
| akhayrutdinov | 5111 |
| mb1973 | 4976 |
| Quandray | 4752 |