Fundamentals8 steps

Programming 101

The building blocks. Data structures, complexity and the patterns underneath everything else.

0 / 8 · 0%

Tap the circle on each step to track your progress — it’s saved in this browser

  1. 01

    What is a data structure?

    Pending

    What a data structure is and why the logical organisation of your data decides everything.

    Article3 min2 exercises
  2. 02

    BigO Notation

    Pending

    How to measure the efficiency of an algorithm — and when it stops mattering.

    Article3 min2 exercises
  3. 03

    Amortised complexity

    Pending

    Why inserting into a dynamic array is O(1) even though it sometimes costs O(n).

    Article3 min2 exercises
  4. 04

    Arrays and Linked Lists

    Pending

    The fastest structure vs. the most flexible one, and the trade-off between them.

    Article7 min2 exercises
  5. 05

    Stacks and Queues

    Pending

    Two structures behind undo, scheduling and half the interview questions.

    Article16 min2 exercises
  6. 06

    Trees and BSTs

    In progress

    Hierarchies, ordered search and where the log n comes from.

    Article2 exercises
    In progress
  7. 07

    Hash Tables

    In progress

    Constant-time lookup, collisions and why the load factor matters.

    Article2 exercises
    In progress
  8. 08

    Graphs

    In progress

    Modelling relationships. Traversal, shortest paths and when a graph is overkill.

    Article2 exercises
    In progress