> For the complete documentation index, see [llms.txt](https://jaywin.gitbook.io/leetcode/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://jaywin.gitbook.io/leetcode/solutions/0203-remove-linked-list-elements.md).

# 0203. Remove Linked List Elements

<https://leetcode.com/problems/remove-linked-list-elements>

## Description

Given the `head` of a linked list and an integer `val`, remove all the nodes of the linked list that has `Node.val == val`, and return *the new head*.

**Example 1:**

![](https://assets.leetcode.com/uploads/2021/03/06/removelinked-list.jpg)

```
**Input:** head = [1,2,6,3,4,5,6], val = 6
**Output:** [1,2,3,4,5]
```

**Example 2:**

```
**Input:** head = [], val = 1
**Output:** []
```

**Example 3:**

```
**Input:** head = [7,7,7,7], val = 7
**Output:** []
```

**Constraints:**

* The number of nodes in the list is in the range `[0, 104]`.
* `1 <= Node.val <= 50`
* `0 <= val <= 50`

## ac

```java
```
