Module 01 · Entry Point
Arrays & Sequences — the substrate of everything
Contiguous memory, indexing arithmetic, two-pointer and sliding-window patterns. The foundation on which every later module is built.
Open moduleBeginner-friendly
A Curriculum · Not a Cheatsheet
The Architecture of Algorithms
AlgoMastery is a free, rigorously structured path through the ideas that power modern software — arrays to graphs, recursion to dynamic programming. Every module is taught the way it should be: with worked examples, honest complexity analysis, and the reasoning behind every line of code.
9
Modules
120+
Worked Examples
Free
Always · No Login
Process · How You Learn Here
Four phases. No shortcuts, no filler.
Step 01
Read the Module
Each topic opens with a precise, example-first explanation — mental model first, code second.
Step 02
Trace the Code
Every implementation is annotated line-by-line. You will not meet an unexplained variable in this curriculum.
Step 03
Analyse the Cost
Complexity is reasoned about, not asserted. "Why O(n log n) and not O(n²)" — stated explicitly, for every algorithm.
Step 04
Apply to Problems
Curated problem sets with difficulty badges, pattern tags, and solution walkthroughs that explain the choice of approach.
Curriculum · 9 Modules
Browse all modulesA guided path through the canon.
Dynamic Programming
The geometry of optimal substructure — memoisation, tabulation, state design. The hardest and most rewarding module.
Enter module →Module 02The Discipline of Pointers
A linked list is the refusal to hold memory in one piece. Each node is a signpost: a small payload and an arrow pointing to the next signpost. The pri…
Module 03Advanced String Manipulation
Strings are arrays with a finite alphabet — usually ASCII, sometimes Unicode, occasionally just {A, C, G, T}. That constraint is a gift. A small alpha…
Module 04The Algebra of Membership
A hash map is a machine that converts the question 'have I seen this key before?' from a linear search into a constant-time lookup. That single capabi…
Module 05Recursion as Structural Induction
Trees are the first data structure where recursion stops being a cute control-flow trick and becomes the only natural language. A binary tree is eithe…
Module 07The Vocabulary of Relationships
Almost every problem involving connections — cities by roads, people by friendships, pages by links, tasks by dependencies — is a graph problem in dis…
Module 08The Price of Order
Sorting is rarely the goal. Sorting is the <em>preparation</em> that makes the real goal cheap: finding duplicates, computing medians, applying two-po…
Module 09Two Hands on a Number Line
The two-pointer technique and its cousin, the sliding window, are the single most transferable patterns in this curriculum. They appear in array probl…
Pathways · Choose Your Approach
Three honest routes through the material.
Pathway A
The Interview Sprint
Six weeks. Focused on the 40 patterns that appear in 90% of technical screens. Targeted problem lists per module; complexity analysis drilled into muscle memory.
Best for: engineers with a loop two months away.
Pathway B
The Foundations Track
Twelve weeks. Each module read end-to-end with its concept deep-dives. Prerequisite chains respected — arrays before strings before two pointers. Builds a real mental model.
Best for: self-taught engineers filling in gaps.
Pathway C
The Reference Orbit
Dip in as needed. Use the topic index as a lookup, read the module you're stuck on, close the tab. No progress tracking, no guilt.
Best for: working engineers who already have the basics.
A Quiet Newsletter
One essay a week. Algorithm thinking, not hot takes.
A long-form note when a new module is published — interview patterns, subtle bugs, the architecture of a problem. No tracking, no unsubscribe pop-ups, no churn.