Linked List 10: Merge two sorted Linked lists | Must Do Coding Questions | GeeksForGeeks

This video contains Must Do Coding Questions for Companies like Amazon, Microsoft, Adobe, … from geeksforgeeks platform. website link: https://www.geeksforgeeks.org/must-do-coding-questions-for-companies-like-amazon-microsoft-adobe/ Topics covered in this video series are: 1.Arrays https://youtube.com/playlist?list=PLvI381EFf-Uio-3KkcLtYoe7GaIaxSb6f 2.String https://www.youtube.com/playlist?list=PLvI381EFf-Uj4bxfEYAkRka9uEeKlEM-Y 3.Linked List https://www.youtube.com/playlist?list=PLvI381EFf-UgpDSXy9yFTdKRvwUZNIAE- 4.Stack and Queue 5.Tree and BST 6.Heap 7.Recursion 8.Hashing 9.Graph 10.Greedy 11.Dynamic Programming 12.Divide and Conquer 13.Backtracking 14.Bit Magic Linked List: 10. Merge two sorted linked lists: Given two sorted linked lists consisting of N and M nodes respectively. The task is to merge both of the list (in-place) and return head of the merged list. Example 1: Input: N = 4, M = 3 valueN[] = {5,10,15,40} valueM[] = {2,3,20} Output: 2 3 5 10 15 20 40 Explanation: After merging the two linked lists, we have merged list as 2, 3, 5,10, 15, 20, 40. Example 2: Input: N = 2, M = 2 valueN[] = {1,1} valueM[] = {2,4} Output:1 1 2 4 Explanation: After merging the given two linked list , we have 1, 1, 2, 4 as output. Code Link: https://github.com/krishna-gavas/Competitive-Coding/tree/master/GeeksForGeeks/Arrays Intro Music : https://youtu.be/93YYANzHbV4p