# Remove Linked List Elements Problem

## Description

LeetCode Problem 203.

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:

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

Example 2:

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

Example 3:

``````1
2
Input: head = [7,7,7,7], val = 7
Output: []
``````

Constraints:

• The number of nodes in the list is in the range [0, 10^4].
• 1 <= Node.val <= 50
• 0 <= val <= 50

## Sample C++ Code

``````1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
/**
* struct ListNode {
*     int val;
*     ListNode *next;
*     ListNode() : val(0), next(nullptr) {}
*     ListNode(int x) : val(x), next(nullptr) {}
*     ListNode(int x, ListNode *next) : val(x), next(next) {}
* };
*/
class Solution {
public:
ListNode* removeElements(ListNode* head, int val) {

while (curr->next != NULL) {
if (curr->next->val == val) {
curr->next = curr->next->next;
} else {
curr = curr->next;
}
}

}
};
``````