Slug: list-deque-01 · Paired reading: Chapter 18
Prompt
Implement Queue<T> with enqueue (back) and dequeue (front) over
std::collections::VecDeque<T>. This is the idiomatic double-ended
"list" answer — a ring buffer, not pointer nodes.
The curriculum, drills, tutor, and interviewer mode are for readers of Ace the Rust Interview. The code is printed in the Preface (Companion site access).
Don’t have the book yet? The landing page stays open — purchase unlocks this gym.
intermediate · order 67
Slug: list-deque-01 · Paired reading: Chapter 18
Implement Queue<T> with enqueue (back) and dequeue (front) over
std::collections::VecDeque<T>. This is the idiomatic double-ended
"list" answer — a ring buffer, not pointer nodes.