<h2><a href="https://www.geeksforgeeks.org/problems/intersection-of-two-sorted-linked-lists/1">Intersection of two sorted Linked lists</a></h2><h3>Difficulty Level : Easy</h3><hr><div class="problems_problem_content__Xm_eO"><p><span style="font-size: 18px;">Given <strong>two linked lists </strong>sorted in <strong>increasing order</strong>, create a new linked list representing the <strong>intersection </strong>of the two linked lists. The new linked list should be made with without changing the original lists.</span></p>
<p><span style="font-size: 18px;"><strong>Note:</strong> The elements of the linked list are not necessarily distinct.</span></p>
<p><span style="font-size: 18px;"><strong>Example 1:</strong></span></p>
<pre><span style="font-size: 18px;"><strong>Input:
</strong>LinkedList1 = 1-&gt;2-&gt;3-&gt;4-&gt;6
LinkedList2 = 2-&gt;4-&gt;6-&gt;8
<strong>Output: </strong>2 4 6<strong>
Explanation: </strong>For the given two
linked list, 2, 4 and 6 are the elements
in the intersection.</span></pre>
<p><span style="font-size: 18px;"><strong>Example 2:</strong></span></p>
<pre><span style="font-size: 18px;"><strong>Input:
</strong>LinkedList1 = 10-&gt;20-&gt;40-&gt;50
LinkedList2 = 15-&gt;40
<strong>Output: </strong>40<br></span></pre>
<p><span style="font-size: 18px;"><strong>Your Task:</strong><br>You don't have to take any input of print anything. Your task is to complete the function <strong>findI</strong><strong>ntersection</strong>(), which will take <strong>head </strong>of both of the linked lists as input and should find the<strong> intersection </strong>of two linked list and add all the elements in <strong>intersection </strong>to the <strong>third linked list </strong>and <strong>return the head </strong>of the third linked list.</span></p>
<p><span style="font-size: 18px;"><strong>Expected Time Complexity</strong> : O(n+m)<br><strong>Expected Auxilliary Space</strong> : O(n+m)<br><strong>Note:</strong> n, m are the size of the respective linked lists.</span></p>
<p><span style="font-size: 18px;"><strong>Constraints:</strong><br>1 &lt;= size of linked lists &lt;= 5000<br>1 &lt;= Data in linked list nodes &lt;= 10<sup>4</sup></span></p></div><p><span style=font-size:18px><strong>Company Tags : </strong><br><code>Amazon</code>&nbsp;<code>Microsoft</code>&nbsp;<code>D-E-Shaw</code>&nbsp;<code>Zopper</code>&nbsp;<br><p><span style=font-size:18px><strong>Topic Tags : </strong><br><code>Linked List</code>&nbsp;<code>Sorting</code>&nbsp;<code>Data Structures</code>&nbsp;<code>Algorithms</code>&nbsp;