v0.40: Create exercises. Challenge the community.

list_node_count

Your mission

Implement a function that counts how many nodes are chained together in a singly linked list.

See it in action

list_node_count(NULL)

Expected result

Your checklist

For your own tracking. Tests grade your code.

The list is built from ListNode structs, each carrying a next pointer and a data pointer.
Starting from head, follow each next pointer until you reach NULL.
Count every node you visit, including the first one.
Return the total as an int. Return 0 when head is NULL.
The prototype is int list_node_count(ListNode *head);.

More examples

list_node_count(head) // list: A -> B -> C -> NULL

Expected result

list_node_count(head) // list: X -> NULL

Expected result

Constraints

Expected files

list_node_count.c

Allowed functions

None. Write every helper yourself.

Allowed headers

<stddef.h>defines NULL

list_node_count

Linked lists

Your mission

Implement a function that counts how many nodes are chained together in a singly linked list.

See it in action

list_node_count(NULL)

Expected result

Your checklist

For your own tracking. Tests grade your code.

The list is built from ListNode structs, each carrying a next pointer and a data pointer.
Starting from head, follow each next pointer until you reach NULL.
Count every node you visit, including the first one.
Return the total as an int. Return 0 when head is NULL.
The prototype is int list_node_count(ListNode *head);.

More examples

list_node_count(head) // list: A -> B -> C -> NULL

Expected result

list_node_count(head) // list: X -> NULL

Expected result

Constraints

Expected files

list_node_count.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

01Empty list (NULL head)Waiting

02Single nodeWaiting

03Two nodesWaiting

04Five nodesWaiting

list_node_count

Your mission

Implement a function that counts how many nodes are chained together in a singly linked list.

See it in action

list_node_count(NULL)

Expected result

Your checklist

For your own tracking. Tests grade your code.

The list is built from ListNode structs, each carrying a next pointer and a data pointer.
Starting from head, follow each next pointer until you reach NULL.
Count every node you visit, including the first one.
Return the total as an int. Return 0 when head is NULL.
The prototype is int list_node_count(ListNode *head);.

More examples

list_node_count(head) // list: A -> B -> C -> NULL

Expected result

list_node_count(head) // list: X -> NULL

Expected result

Constraints

Expected files

list_node_count.c

Allowed functions

None. Write every helper yourself.

Allowed headers

<stddef.h>defines NULL

list_node_count

Linked lists

Your mission

Implement a function that counts how many nodes are chained together in a singly linked list.

See it in action

list_node_count(NULL)

Expected result

Your checklist

For your own tracking. Tests grade your code.

The list is built from ListNode structs, each carrying a next pointer and a data pointer.
Starting from head, follow each next pointer until you reach NULL.
Count every node you visit, including the first one.
Return the total as an int. Return 0 when head is NULL.
The prototype is int list_node_count(ListNode *head);.

More examples

list_node_count(head) // list: A -> B -> C -> NULL

Expected result

list_node_count(head) // list: X -> NULL

Expected result

Constraints

Expected files

list_node_count.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

01Empty list (NULL head)Waiting

02Single nodeWaiting

03Two nodesWaiting

04Five nodesWaiting

v0.40: Create exercises. Challenge the community.

Meet Studio →