# Challenge: Union & Intersection of Linked Lists

In this lesson, linked lists meet data set operations.

## We'll cover the following

## Problem Statement #

**Union** and **intersection** are two of the most popular operations which can be performed on data sets. Now, you will be implementing them for linked lists! Let’s take a look at their definitions:

### Union #

Given two lists

AandB; the union is the list that contains elements or objects that belong to either A, or to B, or to both.

### Intersection #

Given two lists

AandB, the intersection is the largest list, which contains all the elements that are common to both the sets.

The `union`

function will take two linked lists and return their union.

The `intersection`

function will return all the elements that are common between two linked lists.

### Input #

Two linked lists.

### Output #

- A list containing the union of the two lists.
- A list containing the intersection of the two lists.

### Sample Input #

```
list1 = 10->20->80->60
list1 = 15->20->30->60->45
```

### Sample Output #

```
union = 10->20->80->60->15->30->45
intersection = 20->60
```

Level up your interview prep. Join Educative to access 70+ hands-on prep courses.