list_remove_first: C exercise

Your mission

Remove the first node of a linked list whose data matches ref, and free it.

list_remove_first(&head, &ref, cmp) // list: 3, 7, 5, 7 and ref: 7: list: 3 5 7
list_remove_first(&head, &ref, cmp) // list: 9 and ref: 9: head is NULL
list_remove_first(&head, &ref, cmp) // list: 3, 5 and ref: 8: list: 3 5

Include list.h in list_remove_first.c: it defines ListNode, with a void *data payload and a next pointer.
A node matches when cmp(node->data, ref) returns 0. Any other value means no match.
Unlink the first matching node, then release its data and the node itself with free. The other nodes keep their order, later matches included.
The matching node can be the head. When the function returns, *begin points to the first remaining node, or is NULL if none is left.
When no node matches, or *begin is NULL, the list stays as it was.

Remove the first node of a linked list whose data matches ref, and free it.

list_remove_first(&head, &ref, cmp) // list: 3, 7, 5, 7 and ref: 7: list: 3 5 7
list_remove_first(&head, &ref, cmp) // list: 9 and ref: 9: head is NULL
list_remove_first(&head, &ref, cmp) // list: 3, 5 and ref: 8: list: 3 5

Include list.h in list_remove_first.c: it defines ListNode, with a void *data payload and a next pointer.
A node matches when cmp(node->data, ref) returns 0. Any other value means no match.
Unlink the first matching node, then release its data and the node itself with free. The other nodes keep their order, later matches included.
The matching node can be the head. When the function returns, *begin points to the first remaining node, or is NULL if none is left.
When no node matches, or *begin is NULL, the list stays as it was.

Remove the first node of a linked list whose data matches ref, and free it.

list_remove_first(&head, &ref, cmp) // list: 3, 7, 5, 7 and ref: 7: list: 3 5 7
list_remove_first(&head, &ref, cmp) // list: 9 and ref: 9: head is NULL
list_remove_first(&head, &ref, cmp) // list: 3, 5 and ref: 8: list: 3 5

Include list.h in list_remove_first.c: it defines ListNode, with a void *data payload and a next pointer.
A node matches when cmp(node->data, ref) returns 0. Any other value means no match.
Unlink the first matching node, then release its data and the node itself with free. The other nodes keep their order, later matches included.
The matching node can be the head. When the function returns, *begin points to the first remaining node, or is NULL if none is left.
When no node matches, or *begin is NULL, the list stays as it was.

Remove the first node of a linked list whose data matches ref, and free it.

list_remove_first(&head, &ref, cmp) // list: 3, 7, 5, 7 and ref: 7: list: 3 5 7
list_remove_first(&head, &ref, cmp) // list: 9 and ref: 9: head is NULL
list_remove_first(&head, &ref, cmp) // list: 3, 5 and ref: 8: list: 3 5

Include list.h in list_remove_first.c: it defines ListNode, with a void *data payload and a next pointer.
A node matches when cmp(node->data, ref) returns 0. Any other value means no match.
Unlink the first matching node, then release its data and the node itself with free. The other nodes keep their order, later matches included.
The matching node can be the head. When the function returns, *begin points to the first remaining node, or is NULL if none is left.
When no node matches, or *begin is NULL, the list stays as it was.