intersection of Y LL

Author: sachuverma

DSA Crack Sheet/README.md

@@ -134,6 +134,7 @@
 - [Add 1 to a number represented as linked list](https://practice.geeksforgeeks.org/problems/add-1-to-a-number-represented-as-linked-list/1# "view question") - [Cpp Solution](./solutions/Add%201%20to%20a%20number%20represented%20as%20linked%20list.cpp)
 - [Add two numbers represented by linked lists](https://practice.geeksforgeeks.org/problems/add-two-numbers-represented-by-linked-lists/1# "view question") - [Cpp Solution](./solutions/Add%20two%20numbers%20represented%20by%20linked%20lists.cpp)
 - [Intersection of two sorted Linked lists](https://practice.geeksforgeeks.org/problems/intersection-of-two-sorted-linked-lists/1# "view question") - [Cpp Solution](./solutions/Intersection%20of%20two%20sorted%20Linked%20lists.cpp)
+- [Intersection Point in Y Shapped Linked Lists](https://practice.geeksforgeeks.org/problems/intersection-point-in-y-shapped-linked-lists/1 "view question") - [Cpp Solution](./solutions/Intersection%20Point%20in%20Y%20Shapped%20Linked%20Lists.cpp)
 - []( "view question") - [Cpp Solution](./solutions/.cpp)
 
 ### Binary Tree

DSA Crack Sheet/solutions/Intersection Point in Y Shapped Linked Lists.cpp

@@ -0,0 +1,81 @@
+/*
+Intersection Point in Y Shapped Linked Lists
+=============================================
+
+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:
+LinkList1 = 3->6->9->common
+LinkList2 = 10->common
+common = 15->30->NULL
+Output: 15
+Explanation:
+Y ShapedLinked List
+
+Example 2:
+Input: 
+Linked List 1 = 4->1->common
+Linked List 2 = 5->6->1->common
+common = 8->4->5->NULL
+Output: 8
+Explanation: 
+
+4              5
+|              |
+1              6
+ \             /
+  8   -----  1 
+   |
+   4
+   |
+  5
+  |
+  NULL       
+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)
+
+Constraints:
+1 ≤ N + M ≤ 2*105
+-1000 ≤ value ≤ 1000
+*/
+
+int intersectPoint(Node *head1, Node *head2)
+{
+  int len1 = 0, len2 = 0;
+  auto temp1 = head1, temp2 = head2;
+  while (temp1)
+  {
+    len1++;
+    temp1 = temp1->next;
+  }
+
+  while (temp2)
+  {
+    len2++;
+    temp2 = temp2->next;
+  }
+
+  int k = abs(len1 - len2);
+  temp1 = head1;
+  temp2 = head2;
+
+  if (len2 > len1)
+    swap(temp1, temp2);
+  for (int i = 0; i < k; ++i)
+    temp1 = temp1->next;
+
+  while (temp1 && temp2)
+  {
+    if (temp1 == temp2)
+      return temp1->data;
+    temp1 = temp1->next;
+    temp2 = temp2->next;
+  }
+
+  return 0;
+}