LC

Linked List in Safe Rust

hard2/10

Understanding Ownership Unsafe Rust: Raw Pointers

Language

Compiler

2.0s Limit 256MB

Implementation

Implement a singly linked list in safe Rust and learn to fight the borrow checker intentionally.

Requirements:

Define List enum with Empty and Cons variants
Implement new() for empty list
Implement push() to add elements
Implement pop() to remove elements
Handle ownership correctly
Make the borrow checker happy
Test with multiple operations

Why This Matters

Linked lists are famously hard in safe Rust — the 'Learn Rust With Entirely Too Many Linked Lists' book exists because doubly-linked nodes fight the single-owner rule. Working through Option<Box<Node>> teaches how ownership reshapes data-structure design, and why the standard library's LinkedList uses unsafe internally.

Hints

0 / 3 revealed

Validation Suite

main.c

Workspace 1.0