# Documentation

## **Merge Sorted Linked Lists**

Asked in:  <a><img src= "https://img.shields.io/badge/-Zoho-red" height="25">&nbsp;&nbsp;
<img src= "https://img.shields.io/badge/-Amazon-yellow" height="25">&nbsp;&nbsp;
<img src= "https://img.shields.io/badge/-Microsoft-blue" height="25">&nbsp;&nbsp;
<img src= "https://img.shields.io/badge/-GeekforGeeks-darkgreen">&nbsp;&nbsp;
<img src= "https://img.shields.io/badge/-CPP-brown">&nbsp;&nbsp;


### Problem Statement 
Given 2 sorted linked lists , merge the two given sorted linked list and print the final Linked List.

**Constraints:**

              0<= N1, N2 <= 10^6 
              -10^7 <= Ai <= 10^7


**Example 1 :**

        Input:
               4
               1 3 5 7
               3
               2 4 6
        
        Output: 

               1 2 3 4 5 6 7 
               
        Explanation: 
                     If the first linked list a is 1->3->5->7 and the other linked list b is 2->4->6, then SortedMerge() should return a pointer to the head node of the merged list 1->2->3->4->5->6->7.
                     

***[For Reference](https://practice.geeksforgeeks.org/problems/merge-two-sorted-linked-lists/1)***
