Data Structures & Algorithms
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.
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.
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
- Big-O and analyzing complexity
- Arrays and dynamic arrays
- Linked lists
- Stacks and queues
- Hash tables and how they work
M2 Trees, heaps, and graphs Ch 6-10 · 5 chapters
- Trees and binary search trees
- Balanced trees and their trade-offs
- Heaps and priority queues
- Graphs and their representations
- Traversals: BFS and DFS
M3 Essential algorithms Ch 11-15 · 5 chapters
- Sorting algorithms and their trade-offs
- Searching and binary search
- Recursion and divide and conquer
- Greedy algorithms
- Dynamic programming
M4 Problem-solving patterns Ch 16-20 · 5 chapters
- Two pointers and sliding window
- Graph algorithms: shortest paths
- Backtracking
- Pattern recognition for interviews
- The problem-solving capstone
Three ways to take Data Structures and Algorithms
| 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 |
Get the programme guide
The full chapter list, what each module covers, and how the tiers compare - sent to your inbox as a PDF.
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 deskBring this to your desk
Download the full curriculum, or talk to us about running it for a team.