Skip to content
Free lessons · Made by VeraStack Labs

DSA in Rust

Data structures, one working build at a time.

Data structures

Part 1: data structures

Thirteen lessons planned. Three are ready, and the rest are coming next.

  1. 00Setting up, and how to read these pagescargo new, cargo test, the Playground
  2. 01Arrays and VecSlices, bounds checks, capacity and length
  3. 02StringsString and &str, UTF-8, why indexing by number fails
  4. 03Linked listsBox, Option, and why they are hard in RustComing next
  5. 04StacksVec as a stackComing next
  6. 05Queues and dequesVecDeque and ring buffersComing next
  7. 06Hash maps and setsHashMap, HashSet, the entry APIComing next
  8. 07Trees and binary search treesOption<Box<Node>> and recursionComing next
  9. 08Heaps and priority queuesBinaryHeap, and Reverse for a min-heapComing next
  10. 09Ordered mapsBTreeMap and range queriesComing next
  11. 10Graphs: representationsVec<Vec<usize>> and indices instead of referencesComing next
  12. 11TriesNested maps and prefix searchComing next
  13. 12Union-findPath compression and ranksComing next
How a lesson is built

Seven parts, every time

So you always know where the cost table is.

  1. 01What it is
  2. 02The idea
  3. 03Build it
  4. 04Standard library
  5. 05Cost
  6. 06Practise
  7. 07Interview notes

Every piece of Rust on these pages is a real file that is compiled and tested before the page is built, so the code you read is the code that ran. Your progress is kept in this browser only. Nothing is sent anywhere.

Made by VeraStack Labs