All learning paths

Data structures & algorithms

Start with the work a program does. Then build the patterns that help you solve a problem, explain your choice, and handle the edge cases.

Use small Go examples, worked problems, and clear time and space trade-offs. Begin with the first two lessons below.

2 available · 10 planned

Your learning path

Start with the linked lessons. The remaining topics are planned.

  1. Understand the cost of code

    Count the work in a Go program, compare growth rates, and separate running time from extra memory.

    Available
  2. Arrays, slices, and boundaries

    Trace length, capacity, shared storage, and safe boundaries through a runnable Go example.

    Available
  3. Maps and sets

    Fast lookup, counting, and choosing what to store.

    Planned
  4. Two pointers

    Move through ordered data with a clear invariant.

    Planned
  5. Sliding windows

    Maintain the useful part of a sequence as its boundaries move.

    Planned
  6. Prefix sums

    Do the work once to answer range queries.

    Planned
  7. Binary search

    Define the search space and shrink it safely.

    Planned
  8. Stacks

    Use last-in, first-out order to remember unfinished work.

    Planned
  9. Queues

    Process work in the order it arrives.

    Planned
  10. Linked lists

    Follow references and update links without losing data.

    Planned
  11. Recursion and tree depth-first search

    Define a base case and understand the call stack.

    Planned
  12. Tree breadth-first search

    Visit a tree one level at a time.

    Planned