Microsoft interview question
Design and implement a "inner join" function using 2 sorted lists/arrays. Make it run in O(n) time.
Interview Answers
Anonymous
26 May 2020
//MERGING SORTED LIST public ListNode mergeTwoLinkedList(ListNode list1,ListNode list2,ListNode list3) { ListNode dummy=new ListNode(-1); ListNode head=dummy; dummy.next=list1; dummy=dummy.next; ListNode current=dummy; while(current.next!=null) { current=current.next; } current.next=list2; current=current.next; while(current.next!=null) { current=current.next; } current.next=list3; return head.next; }