Computer Science

Software EngineerBackend EngineerSystems EngineerAny CS interview

Begin with how a machine represents a number and end able to reason about algorithmic complexity, memory, concurrency and databases. This is the path that makes every other path easier — and it is the material technical interviews at strong companies actually test.

Curriculum

Tier 0 · Fundamentals

Thinking Like a Programmer

0/4

01What a Program Actually Is9m · +25 XP 02Breaking a Problem Into Steps11m · +30 XP 03Reading Errors and Debugging Calmly11m · +30 XP 04Building Your First Real Program12m · +35 XP

How Computers Actually Work

0/5

01Bits, Bytes and Representing Everything10m · +25 XP 02Bitwise Operations and Masks9m · +30 XP 03The CPU, Memory and the Operating System9m · +25 XP 04From Source Code to a Running Process10m · +25 XP 05Caches, Branches and Why Fast Code Is Fast18m · +40 XP

Programming Foundations

0/4

01Variables, Types and Control Flow10m · +25 XP 02Functions, Scope and Abstraction9m · +25 XP 03The Data Structures You Use Every Day10m · +30 XP 04Closures, Immutability and Higher-Order Functions17m · +40 XP

Python Fluency

0/6

01Strings, Bytes and Unicode11m · +30 XP 02Exceptions and Context Managers12m · +30 XP 03Iterators and Generators10m · +30 XP 04Classes and Data Modelling13m · +30 XP 05Modules, Packages and Type Hints13m · +30 XP 06Reading Java, TypeScript and C11m · +30 XP

Tier 1 · Core

Discrete Maths You Actually Need

0/4

01Logic and Boolean Algebra16m · +30 XP 02Sets, Relations and Functions15m · +30 XP 03Counting, Combinations and Enough Probability16m · +30 XP 04Induction, Recursion and Proving a Loop Correct17m · +35 XP

Data Structures

0/6

01Linked Lists, Stacks and Queues17m · +30 XP 02Inside a Hash Table15m · +30 XP 03Trees and Binary Search Trees18m · +35 XP 04Heaps and Priority Queues16m · +35 XP 05Graphs: Representations and Traversal18m · +35 XP 06Structures for Specific Problems18m · +45 XP

Algorithms and Complexity

0/6

01Big-O Without the Mathematics13m · +30 XP 02Amortised Analysis and Recurrences11m · +35 XP 03Sorting and Searching12m · +35 XP 04Quicksort, Selection and Linear-Time Sorts15m · +35 XP 05Recursion, Memoisation and Dynamic Programming13m · +35 XP 06Graph Algorithms You Will Actually Use19m · +45 XP

Problem-Solving Patterns

0/7

01Two Pointers and Sliding Windows13m · +40 XP 02Prefix Sums and Hash Counting12m · +40 XP 03Binary Search on Answers, and Intervals14m · +40 XP 04Backtracking and Search13m · +40 XP 05Greedy Algorithms and Exchange Arguments9m · +40 XP 06Dynamic Programming in Two Dimensions13m · +40 XP 07Grids and Implicit Graphs15m · +40 XP

Verifying Code

0/7

01Test Design from the Specification13m · +40 XP 02Invariants and Assertions14m · +40 XP 03Oracles and Randomised Testing14m · +40 XP 04Tracing Code and Predicting Output14m · +40 XP 05Scientific Debugging and Bisection13m · +40 XP 06Reviewing AI-Generated Code11m · +40 XP 07A Verification-First Workflow12m · +40 XP

Tier 2 · Advanced

Systems and Concurrency

0/4

01Memory Management and Garbage Collection16m · +35 XP 02Processes, Threads and Concurrency20m · +40 XP 03Networking and I/O from a CS Perspective15m · +35 XP 04Atomics, Memory Models and Lock-Free Basics18m · +45 XP

Operating Systems in Depth

0/4

01Scheduling and Context Switching17m · +40 XP 02Virtual Memory and Paging18m · +40 XP 03Filesystems, Inodes and Durability17m · +40 XP 04System Calls and the Kernel Boundary16m · +40 XP

How Languages Actually Work

0/4

01From Text to Tokens to Trees17m · +40 XP 02Interpreters, Bytecode and JIT18m · +40 XP 03Type Systems and What They Prove17m · +40 XP 04Optimisation: Why Your Code Is Not What Runs17m · +40 XP

Databases and Computation

0/4

01The Relational Model and SQL18m · +35 XP 02Indexes, Query Plans and Transactions18m · +40 XP 03What Computers Cannot Do14m · +35 XP 04Inside the Database: MVCC and the Query Planner19m · +45 XP