Beta 0.35.0
Beta
Search
Dashboard
Learn
Exercises
Challenges
Compete
Visualizer
What's new
v0.35.0
Search
Search for a chapter, module, exercise, challenge, page, or profile
Dashboard
Learn
Exercises
Challenges
Compete
Visualizer
Sign in
Path
Learn C graph
Catalog preview
0%
Get started
0 / 5 modules
Structure your code
0 / 4 modules
Text
0 / 6 modules
Memory
0 / 3 modules
Your own types
0 / 5 modules
The machine
0 / 4 modules
The system
0 / 1 modules
First program
0 / 7
Read the error
0 / 5
Types and values
0 / 7
Conditions and loops
0 / 7
Command line
0 / 6
Functions
0 / 5
Recursion
0 / 6
Pointers
0 / 7
Arrays and matrices
0 / 7
Characters and ASCII
0 / 4
Strings: walking and…
0 / 6
Writing text without…
0 / 4
Words and tokens
0 / 4
Transforming text
0 / 5
Numbers and bases
0 / 6
Dynamic memory
0 / 5
Bytes and raw memory
0 / 4
Memory safety
0 / 6
Structs, unions, enu…
0 / 6
Headers and the prep…
0 / 3
Linked lists
0 / 4
Stacks, queues, trees
0 / 3
Generic code
0 / 3
Bits and representat…
0 / 4
Sorting and searching
0 / 7
Files and streams
0 / 3
Parsing and formats
0 / 4
Processes and signals
0 / 4
C foundations checkpo…
5 tasks · not ready
Code structure checkp…
4 tasks · not ready
Text handling checkpo…
5 tasks · not ready
Memory safety checkpo…
3 tasks · not ready
Types and data struct…
4 tasks · not ready
Machine model checkpo…
4 tasks · not ready
Processes and signals…
2 tasks · not ready
Chapter checkpoints
100%
Fit
Arrays and matrices
One and two dimensional arrays, row-major order, and array decay.
Required exercises
0 / 7
7 required exercises
·
4 optional
·
Difficulty 2 to 4
·
0 / 304 XP
Exercises · 11
Exercise
Level
XP
Status
int_range
int *int_range(int from, int to)
+16
New
range_desc
int *range_desc(int min, int max)
+16
New
reverse_int
void reverse_int(int *a, size_t n)
+12
New
prefix_sum
void prefix_sum(const int *a, size_t n, long *out)
+12
New
unique_sorted
size_t unique_sorted(int *a, size_t n)
+16
New
row_sums
void row_sums(const int (*rows)[4], size_t nrows, int *out)
+16
New
flood_fill
void flood_fill(char **tab, Point size, Point begin)
+24
New
chess_check
Optional
Detect whether a chess board configuration puts the King in check
+32
New
route_loop_length
Optional
Read points from stdin and print the shortest closed route length
+32
New
largest_clear_square
Optional
Mark the largest obstacle-free square in a map read from stdin.
+64
New
life_board_draw
Optional
Draw an initial board from stdin, then simulate cellular life.
+64
New
View module
Complete
Recommended now
In progress
Available
Learn checkpoint