Given two Linked List, the task is to create a Linked List to store the difference of Linked List 1 with Linked List 2, i.e. the elements present in List 1 but not in List 2.**Examples:**

Input:

List1: 10 -> 15 -> 4 ->20,

List2: 8 -> 4 -> 2 -> 10Output:15 -> 20Explanation:

In the given linked list elements 15 and 20 are present in the list 1 but not in list 2.Input:

List1: 2 -> 4 -> 8 -> 10,

List2: 8 -> 10Output:2 -> 4Explanation:

In the given linked list 1 elements 2 and 4 are present in the list 1 but not in list 2.

**Approach:**

- Sort both Linked Lists using merge sort.
- Linearly scan both sorted lists to get the difference with two pointers on it p1 and p2 and compare the data of the nodes in the linked list and perform following in below three cases –
- If
**p1.data == p2.data**then, p1.data cannot be in the difference list, So move the pointers p1 and p2 ahead. - If
**p1.data > p2.data**then, p1.data may be present in list 2 in further nodes, So move the pointer p2 ahead. - If
**p1.data > p2.data**then, p1.data cannot be present in list 2 now, So add the data of p1 into difference list and move pointer p1 ahead.

- If
- If the end of list 2 is reached, insert all the remaining elements of list 1 into the difference list.

Below is the implementation of the above approach.

## Python

`# Python implementation to create` `# a difference Linked List of` `# two Linked Lists` `# Node of the Linked List` `class` `Node:` ` ` `def` `__init__(` `self` `, data):` ` ` `self` `.data ` `=` `data` ` ` `self` `.` `next` `=` `None` `# Linked List` `class` `linked_list:` ` ` `def` `__init__(` `self` `):` ` ` `self` `.head ` `=` `None` ` ` ` ` `# Function to insert a node` ` ` `# at the end of Linked List` ` ` `def` `append(` `self` `, data):` ` ` `temp ` `=` `Node(data)` ` ` `if` `self` `.head ` `=` `=` `None` `:` ` ` `self` `.head ` `=` `temp` ` ` `else` `:` ` ` `p ` `=` `self` `.head` ` ` `while` `p.` `next` `!` `=` `None` `:` ` ` `p ` `=` `p.` `next` ` ` `p.` `next` `=` `temp` ` ` `# Function to find the middle` ` ` `# node of the Linked List` ` ` `def` `get_mid(` `self` `, head):` ` ` `if` `head ` `=` `=` `None` `:` ` ` `return` `head` ` ` `slow ` `=` `fast ` `=` `head` ` ` `while` `fast.` `next` `!` `=` `None` `\` ` ` `and` `fast.` `next` `.` `next` `!` `=` `None` `:` ` ` `slow ` `=` `slow.` `next` ` ` `fast ` `=` `fast.` `next` `.` `next` ` ` `return` `slow` ` ` `# Recursive method to merge the` ` ` `# two half after sorting` ` ` `def` `merge(` `self` `, l, r):` ` ` `if` `l ` `=` `=` `None` `:` `return` `r` ` ` `if` `r ` `=` `=` `None` `:` `return` `l` ` ` `if` `l.data<` `=` `r.data:` ` ` `result ` `=` `l` ` ` `result.` `next` `=` `\` ` ` `self` `.merge(l.` `next` `, r)` ` ` `else` `:` ` ` `result ` `=` `r` ` ` `result.` `next` `=` `\` ` ` `self` `.merge(l, r.` `next` `)` ` ` `return` `result` ` ` `# Recursive method to divide the` ` ` `# list into two half until 1 node left` ` ` `def` `merge_sort(` `self` `, head):` ` ` `if` `head ` `=` `=` `None` `or` `head.` `next` `=` `=` `None` `:` ` ` `return` `head` ` ` `mid ` `=` `self` `.get_mid(head)` ` ` `next_to_mid ` `=` `mid.` `next` ` ` `mid.` `next` `=` `None` ` ` `left ` `=` `self` `.merge_sort(head)` ` ` `right ` `=` `self` `.merge_sort(next_to_mid)` ` ` `sorted_merge ` `=` `self` `.merge(left, right)` ` ` `return` `sorted_merge` ` ` `# Function to print the list elements` ` ` `def` `display(` `self` `):` ` ` `p ` `=` `self` `.head` ` ` `while` `p !` `=` `None` `:` ` ` `print` `(p.data, end ` `=` `' '` `)` ` ` `p ` `=` `p.` `next` ` ` `print` `()` `# Function to get the difference list` `def` `get_difference(p1, p2):` ` ` `difference_list ` `=` `linked_list()` ` ` `# Scan the lists` ` ` `while` `p1 !` `=` `None` `and` `p2 !` `=` `None` `:` ` ` ` ` `# Condition to check if the` ` ` `# Data of the both pointer are` ` ` `# same then move ahead` ` ` `if` `p2.data ` `=` `=` `p1.data:` ` ` `p1 ` `=` `p1.` `next` ` ` `p2 ` `=` `p2.` `next` ` ` ` ` `# Condition to check if the` ` ` `# Data of the first pointer is` ` ` `# greater than second then` ` ` `# move second pointer ahead` ` ` `elif` `p2.data<p1.data:` ` ` `p2 ` `=` `p2.` `next` ` ` ` ` `# Condition when first pointer` ` ` `# data is greater than the` ` ` `# second pointer then append` ` ` `# into the difference list and move` ` ` `else` `:` ` ` `difference_list.append(p1.data)` ` ` `p1 ` `=` `p1.` `next` ` ` `# If end of list2 is reached,` ` ` `# there may be some nodes in` ` ` `# List 1 left to be scanned,` ` ` `# they all will be inserted` ` ` `# in the difference list` ` ` `if` `p2 ` `=` `=` `None` `:` ` ` `while` `p1:` ` ` `difference_list.append(p1.data)` ` ` `p1 ` `=` `p1.` `next` ` ` `return` `difference_list` `# Driver Code` `if` `__name__ ` `=` `=` `'__main__'` `:` ` ` `# Linked List 1` ` ` `list1 ` `=` `linked_list()` ` ` `list1.append(` `2` `)` ` ` `list1.append(` `6` `)` ` ` `list1.append(` `8` `)` ` ` `list1.append(` `1` `)` ` ` ` ` `# Linked List 2` ` ` `list2 ` `=` `linked_list()` ` ` `list2.append(` `4` `)` ` ` `list2.append(` `1` `)` ` ` `list2.append(` `9` `)` ` ` ` ` `# Sort both the linkedlists` ` ` `list1.head ` `=` `list1.merge_sort(` ` ` `list1.head` ` ` `)` ` ` `list2.head ` `=` `list2.merge_sort(` ` ` `list2.head` ` ` `)` ` ` ` ` `# Get difference list` ` ` `result ` `=` `get_difference(` ` ` `list1.head, list2.head` ` ` `)` ` ` `if` `result.head:` ` ` `result.display()` ` ` ` ` `# if difference list is empty,` ` ` `# then lists are equal` ` ` `else` `:` ` ` `print` `(` `'Lists are equal'` `)` |

**Output:**

2 6 8

**Time complexity:** O(M Log M + N Log N).

Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the **DSA Self Paced Course** at a student-friendly price and become industry ready. To complete your preparation from learning a language to DS Algo and many more, please refer **Complete Interview Preparation Course****.**

In case you wish to attend live classes with industry experts, please refer **DSA Live Classes**