Create intersect_linkedlist.cpp

find the point of intersection of two linked lists ; 
time complexity O(n^2);

Author: kasyap1234

intersect_linkedlist.cpp

@@ -0,0 +1,35 @@
+class Solution {
+public:
+    ListNode *getIntersectionNode(ListNode *headA, ListNode *headB) {
+        ListNode*first=headA; 
+        ListNode*second=headB; 
+        ListNode*internode; 
+        int flag; 
+        
+        while(first!=NULL){
+            second=headB; 
+            while(second!=NULL){
+                if(&first==&second){
+                    flag=1; 
+                    internode=first; 
+                }
+                else{
+                    flag=0; 
+                }
+                second=second->next; 
+                
+            }
+            first=first->next; 
+           
+            
+        }
+        if(flag==1){
+            return internode; 
+        }
+        else{
+            return NULL; 
+            
+        }
+        
+    }
+};