v0.40: Create exercises. Challenge the community.

list_apply

Your mission

Implement a function that walks a singly linked list and invokes a caller-provided callback on the payload of each node.

See it in action

list_apply([7 -> 8 -> 9], print_data)

Expected result

[7][8][9]

Your checklist

For your own tracking. Tests grade your code.

Include list.h in your list_apply.c file; it defines the ListNode type with a void *data payload.
Traverse the list from head to tail and call f(node->data) for every node you visit.
If list is NULL, the function must return without touching anything.
The callback is free to read or mutate the data it receives, your function only forwards the pointer.
The prototype is void list_apply(ListNode *list, void (*f)(void *));.

More examples

list_apply(NULL, print_data)

Expected result

(nothing printed)

Constraints

Expected files

list_apply.c

Allowed functions

None. Write every helper yourself.

Allowed headers

<stddef.h>defines NULL

list_apply

Linked lists

Your mission

Implement a function that walks a singly linked list and invokes a caller-provided callback on the payload of each node.

See it in action

list_apply([7 -> 8 -> 9], print_data)

Expected result

[7][8][9]

Your checklist

For your own tracking. Tests grade your code.

Include list.h in your list_apply.c file; it defines the ListNode type with a void *data payload.
Traverse the list from head to tail and call f(node->data) for every node you visit.
If list is NULL, the function must return without touching anything.
The callback is free to read or mutate the data it receives, your function only forwards the pointer.
The prototype is void list_apply(ListNode *list, void (*f)(void *));.

More examples

list_apply(NULL, print_data)

Expected result

(nothing printed)

Constraints

Expected files

list_apply.c

Allowed functions

None. Write every helper yourself.

Allowed headers

<stddef.h>defines NULL

Tests

Run the tests to grade your code

Build your code, then check each test here. Open a result to inspect its output.

Build

01NULL list does nothingWaiting

02Single node prints onceWaiting

03Three nodes printed head to tailWaiting

04Callback mutates every node's dataWaiting

05Repeated calls accumulate side-effectsWaiting

list_apply

Your mission

Implement a function that walks a singly linked list and invokes a caller-provided callback on the payload of each node.

See it in action

list_apply([7 -> 8 -> 9], print_data)

Expected result

[7][8][9]

Your checklist

For your own tracking. Tests grade your code.

Include list.h in your list_apply.c file; it defines the ListNode type with a void *data payload.
Traverse the list from head to tail and call f(node->data) for every node you visit.
If list is NULL, the function must return without touching anything.
The callback is free to read or mutate the data it receives, your function only forwards the pointer.
The prototype is void list_apply(ListNode *list, void (*f)(void *));.

More examples

list_apply(NULL, print_data)

Expected result

(nothing printed)

Constraints

Expected files

list_apply.c

Allowed functions

None. Write every helper yourself.

Allowed headers

<stddef.h>defines NULL

v0.40: Create exercises. Challenge the community.

Meet Studio →

list_apply

Linked lists

Your mission

Implement a function that walks a singly linked list and invokes a caller-provided callback on the payload of each node.

See it in action

list_apply([7 -> 8 -> 9], print_data)

Expected result

[7][8][9]

Your checklist

For your own tracking. Tests grade your code.

Include list.h in your list_apply.c file; it defines the ListNode type with a void *data payload.
Traverse the list from head to tail and call f(node->data) for every node you visit.
If list is NULL, the function must return without touching anything.
The callback is free to read or mutate the data it receives, your function only forwards the pointer.
The prototype is void list_apply(ListNode *list, void (*f)(void *));.

More examples

list_apply(NULL, print_data)

Expected result

(nothing printed)

Constraints

Expected files

list_apply.c

Allowed functions

None. Write every helper yourself.

Allowed headers

<stddef.h>defines NULL

Tests

Run the tests to grade your code

Build your code, then check each test here. Open a result to inspect its output.

Build

01NULL list does nothingWaiting

02Single node prints onceWaiting

03Three nodes printed head to tailWaiting

04Callback mutates every node's dataWaiting

05Repeated calls accumulate side-effectsWaiting