Frequently asked Linked List Interview Question - Union of two linked lists

Problem statement: Given two linked lists, return the union of two linked lists. This union should include all the distinct elements only. Return the head of the new list. Example : Input: L1 = 9->6->4->2->3->8 L2 = 1->2->8->6->2 Output: 1 2 3 4 6 8...