Beta 0.35.0Beta

Dashboard
Learn
Exercises
Challenges
Compete
Visualizer

What's newv0.35.0

Learn

Dashboard Learn Exercises Challenges

SearchSearch for a chapter, module, exercise, challenge, page, or profile

Dashboard
Learn
Exercises
Challenges
Compete
Visualizer

Linked lists

Get started0/320 / 32 required exercisesRecommended

Structure your code0/250 / 25 required exercisesAhead

Text0/290 / 29 required exercisesAhead

Memory0/150 / 15 required exercisesAhead

Your own types0/190 / 19 required exercisesAhead

Structs, unions, enums Headers and the preprocessor Linked lists Stacks, queues, trees Generic code

The machine0/180 / 18 required exercisesAhead

The system0/40 / 4 required exercisesAhead

Learning C
Your own types
Linked lists

Linked lists

No indexes here. Just nodes, links, and one pointer leading to the next.

Change the chaining itself, not only the payloads
Walk a list with two cursors moving at different speeds

4 exercisesDifficulty 3 to 488 XP availableView in graph

Required exercises

4 exercises

list_node_count

int list_node_count(ListNode *head)

list_apply

void list_apply(ListNode *list, void (*f)(void *))

list_filter

void list_filter(ListNode **begin, void *ref, int (*cmp)(void *, void *))

detect_cycle

int detect_cycle(ListNode *list)

Previous moduleHeaders and the preprocessor Back to Your own types Next moduleStacks, queues, trees