Programme 2 of 9 · Foundations

Data Structures & Algorithms

607 words3 min read

The computer-science core every strong engineer shares: the essential data structures, the algorithms that operate on them, complexity analysis, and the problem-solving patterns that interviews and real systems demand.

Any languageComplexity analysisProblem-solving patternsInterview practice

The core that separates strong engineers

Two developers can both make a feature work, but the one who understands data structures and algorithms will write code that scales, choose the right approach the first time, and reason about performance rather than guessing. This programme builds that computer-science core deliberately, because it is what separates an engineer who can only follow patterns from one who can solve genuinely new problems.

It is also what technical interviews test, for better or worse, so this programme serves a double purpose: it makes you a stronger engineer and it prepares you for the interviews that gate the best roles. The two goals reinforce each other, because the same understanding that impresses an interviewer is what lets you build efficient systems.

The double payoff is real: the same understanding that lets you ace a technical interview is what lets you build systems that scale, so the time invested here serves both your job search and your engineering ability at once.

Curriculum · 20 chapters in 4 modules

The full syllabus

Four modules of five chapters each, sequenced so the material builds cumulatively. The brochure carries a note on what each chapter teaches.

M1 Complexity and core structures Ch 1-5 · 5 chapters
  1. Big-O and analyzing complexity
  2. Arrays and dynamic arrays
  3. Linked lists
  4. Stacks and queues
  5. Hash tables and how they work
M2 Trees, heaps, and graphs Ch 6-10 · 5 chapters
  1. Trees and binary search trees
  2. Balanced trees and their trade-offs
  3. Heaps and priority queues
  4. Graphs and their representations
  5. Traversals: BFS and DFS
M3 Essential algorithms Ch 11-15 · 5 chapters
  1. Sorting algorithms and their trade-offs
  2. Searching and binary search
  3. Recursion and divide and conquer
  4. Greedy algorithms
  5. Dynamic programming
M4 Problem-solving patterns Ch 16-20 · 5 chapters
  1. Two pointers and sliding window
  2. Graph algorithms: shortest paths
  3. Backtracking
  4. Pattern recognition for interviews
  5. The problem-solving capstone
How it is delivered

Three ways to take Data Structures and Algorithms

Self-paced is a document-and-media programme with lifetime access - no live sessions. Cohort and enterprise add live instructor-led training. Mentorship is not offered in any tier.
Feature Self-paced Cohort Enterprise
Format Written chapters, video explainers and podcasts Everything in self-paced, plus scheduled live sessions Everything in cohort, delivered privately to your team
Live sessions None Scheduled, instructor-led Scheduled, instructor-led, private
Mentorship Not offered Not offered Not offered
Access Lifetime Lifetime Lifetime for every enrolled seat
Pace Entirely your own Guided schedule with a peer group Agreed with your desk
Tailoring Fixed curriculum Fixed curriculum Sequenced to your markets, systems and governance
Best for Individuals learning around a job Individuals who want structure and deadlines Desks building the same capability together
For individuals

Get the programme guide

The full chapter list, what each module covers, and how the tiers compare - sent to your inbox as a PDF.

For teams

Run this for my desk

Private delivery for your desk, sequenced to your markets and systems. Tell us the team and we will scope it.

Run this for my desk

Bring this to your desk

Download the full curriculum, or talk to us about running it for a team.

Enrol or enquire See the whole track