The ONLY Data Structures and Algorithms interview prep you need.
by Elman
AlgoPath is a pattern-recognition trainer for coding interviews, with a 150-step course under it. Stop failing them. Months of preparation, then an unfamiliar problem, a minute of nothing.
No account, about seven minutes
A weather log lists up to 100000 daily temperatures. For each day, find how many days you must wait until a strictly warmer day appears (0 if none does).
Which pattern?
5s
No heading, no hints. Same as the interview.
REVIEWS
What learners say
Written by learners of the course, in their own words. Read all reviews · How reviews get here
- steps
- 150steps
- topic groups
- 19topic groups
- patterns
- 52patterns
- recognition prompts
- 194recognition prompts
- languages
- 6languages
- reading depths
- 3reading depths
WHY IT GOES WRONG
Algorithms aren't hated because they're hard. They're taught badly.
01 Every list told you the answer in the heading
The problems you drilled sit under the name of the pattern that solves them. You practised writing the code and never practised choosing it.
02 So the first minutes of the interview go on naming
Not on the code. On working out what kind of problem this is, while the clock runs and someone watches.
TWO ROADMAPS
The usual route loops. This one finishes.
Both roads arrive at the same thing: a problem you have never seen. One of them prepared you for it.
How people usually prepare
No stored answer, and no way to work one out. Then the list again.
The AlgoPath path
The problem is new, the type is not. You name it and work the answer out.
WHERE YOU STAND
Fifteen problems, and the test tells you where to start.
About seven minutes, no account, no code. You read a problem and name the pattern it needs.
- The right pattern for every one of the fifteen
- Which groups held, and which came apart
- The step to pick the course up at
No card and no email. It marks nothing as done.
HOW ONE STEP GOES
How each topic works
Every AlgoPath step goes through the same four stages.
Start from something real
A cache that keeps filling up, a log you have to scan once. Not a puzzle.
Get the idea in plain words
The same lesson also comes in a developer's terms, or formally. You pick.
Write the code yourself
In the browser, against the step's real tests. Reading someone else's answer does not count.
Meet it again with no label
The trainer takes the heading off and asks you to name it, weeks later.
Steps 00-08 assume nothing and are the way in. The first 33 are free in full.
SYLLABUS
The whole course, lesson by lesson
150 lessons in 19 modules, from what an algorithm is to graphs and dynamic programming. Open a module to see its lessons. The first 33 are free.
01Foundations (start here)9 lessons
- 1What is an algorithm?Free
- 2Instructions a computer follows exactlyFree
- 3Data and variables: a labeled boxFree
- 4A list: a row of numbered boxesFree
- 5Doing it for everyone: loopsFree
- 6Making choices: if / elseFree
- 7Your first program: add two numbersFree
- 8Find the biggest numberFree
- 9Why some ways are fasterFree
02Big-O & arrays2 lessons
03Collections & hash tables8 lessons
- 12Sets: a bag that refuses duplicatesFree
- 13Map: a labeled store of key → valueFree
- 14WeakMap and WeakSet: attach data to objectsFree
- 15How a hash table finds a slotFree
- 16Collisions, handled by chainingFree
- 17Collisions, handled by probing (open addressing)Free
- 18Load factor and resizingFree
- 19"Have I seen this?" in one stepFree
04Two pointers & windows5 lessons
05Prefix & difference4 lessons
06Searching5 lessons
07Sorting & intervals11 lessons
- 34Sorting by repeatedly picking the smallest
- 35Sorting by swapping neighbours
- 36Sorting by inserting each item into place
- 37Sorting by splitting and merging
- 38Sorting by partitioning around a pivot
- 39Why comparison sorts stop at n log n
- 40Sorting whole numbers by counting them
- 41Sorting numbers one digit at a time
- 42Sorting by your own rule
- 43Merging overlapping ranges
- 44How many overlap at the busiest moment
08Linked lists7 lessons
09Stacks & queues6 lessons
10Recursion & backtracking7 lessons
11Trees16 lessons
- 65Measuring a tree: how big and how deep
- 66Walking every node of a tree
- 67Comparing trees, and checking a shape
- 68The longest path across a tree
- 69A tree that keeps itself sorted
- 70Is this really a search tree?
- 71Removing a node and keeping order
- 72Why a lopsided tree gets slow
- 73Which fix does this node need?
- 74The left rotation: fixing a right-heavy node
- 75The single right rotation
- 76Double rotations: the zig-zag cases
- 77The insert that rebalances itself
- 78Deleting from an AVL tree
- 79Where two branches meet
- 80Serialize a tree and build it back
12Heaps & top-k7 lessons
- 81A heap: a tree folded into an array
- 82Heapify and pop: build a heap all at once, then remove the min
- 83Sorting by emptying a heap
- 84Always grabbing the smallest, without re-sorting
- 85The 10 biggest out of a billion, without sorting a billion
- 86Merging many sorted streams into one
- 87The middle of a growing list
13Graphs18 lessons
- 88Representing a graph: lists and matrices
- 89Breadth-first search: explore in rings
- 90Depth-first search: go deep, then back up
- 91Fewest steps through a maze
- 92Counting the separate groups
- 93Is there a cycle?
- 94Ordering things that depend on each other
- 95Are these two the same account?
- 96Minimum spanning tree: Kruskal
- 97Minimum spanning tree: Prim
- 98Cheapest route across a weighted map
- 99Shortest path when every step costs 0 or 1
- 100Shortest paths when edges can be negative
- 101Floyd-Warshall: every pair at once
- 102A*: Dijkstra aimed at the goal
- 103A path that uses every edge once
- 104Can these conflicts split into two clean groups?
- 105Groups that can reach each other both ways
14Greedy6 lessons
15Dynamic programming13 lessons
- 112Filling a table where each answer leans on the last one
- 113Fewest coins for an amount, done with a table
- 114Filling a grid where each cell comes from its top and its left
- 115Picking the best set of things that fit a budget
- 116The longest chain you can keep in order
- 117The longest common subsequence of two lists
- 118Turning one word into another, cheapest
- 119Can this text split into dictionary words?
- 120Filling a range DP by length
- 121The cheapest order to merge things
- 122Picking the best set in a hierarchy
- 123Letting the bits of one number be the set
- 124A whole subset packed into one number
16Strings & trie8 lessons
17Bit tricks & math7 lessons
18Matrix & grids5 lessons
PICK YOUR LANGUAGE
Write it in JavaScript, TypeScript, Python, PHP, Java or C#
Same exercise, same tests, six languages. Every one of them runs inside your browser, so nothing installs and no server ever sees your code.
JavaScript
The default. Your code runs in a Web Worker against Node-style assertions.
TypeScript
The same exercise with the types on. They come off in the page, so what runs is the JavaScript worker.
Python
Real CPython in the browser via Pyodide. Write it in idiomatic snake_case.
PHP
Actual PHP 8.3 compiled to WebAssembly. The same cases, zero setup.
Java
A real javac and a real JVM, through CheerpJ. It compiles in the page before it runs.
C#
The .NET runtime and Roslyn, both in the tab. Your code is compiled the way it would be on your machine.
AFTER TEN OF THOSE
You get a list of what you mix up with what.
194 prompts across 52 patterns. The table below is what a few sessions leave behind.
Ten in a row
Ten prompts, one clock, no verdict until the end.
Signals, not vibes
After each answer, the words in the statement that gave it away.
Weakest first
The top row is the next thing to practise. It links to its step.
| Pattern | Recognised | Confused with |
|---|---|---|
| Monotonic stack | 40% | Sliding window |
| Binary search on the answer | 62% | Greedy |
| Union-find | 75% | Graph BFS / DFS |
| Two pointers (opposite ends) | 95% | nothing yet |
PICK YOUR DEPTH
One lesson, three depths
A real paragraph from the course, in the three depths it was written at. Switch between them, and the choice sticks for the whole track.
Take the first test, [0, 1, 0, 3]. The answer has to be [1, 3, 0, 0], and you may not build a second array to get there.
So you work inside the same four boxes. One marker, write, remembers which box gets the next number you keep. It starts at box 0.
You rearrange the elements inside the array itself, with no second array for the work. One index (a position number) marks where the next kept element goes. Another index moves forward and looks for elements to keep.
The transform works on one store of length n. Two indices move through the array: a destination index (where to write) and a scanning index (what to read). Elements move by assignment or by a swap inside the array.
WHERE IT RUNS
Every algorithm runs in software you already use
Each AlgoPath pattern is wired into a small production case, so you see the system it belongs to. A puzzle site gives you the puzzle alone.
Rate limiter
A sliding window keeps an API from being hammered.
LRU cache
A hash map and a linked list decide what stays in memory.
git bisect
Binary search finds the commit that broke the build.
Autocomplete
A trie turns each keystroke into suggestions.
WHO IT IS FOR
Everyone enters at their own speed
An interview in a few weeks
You have solved a few hundred problems and still stall on one with no heading. Take the test, start where it says, and spend the weeks on recognition rather than a fourth pass through arrays.
Starting from zero
No CS background, and every course you opened started in the middle. Steps 00-08 assume nothing and explain each term the first time it appears.
FAQ
Straight answers
What is AlgoPath, exactly?
AlgoPath is a pattern-recognition trainer for coding interviews, with a 150-step course under it. The trainer gives you problems with the label removed, times you, and records which patterns you swap for which. The course is where you go for the ones you could not name.
I have already solved 200 problems. What does this add?
The lists you solved were grouped by pattern, so the heading answered the question for you every time. Here it is gone, and you find out which patterns you actually confuse.
Is this another problem site?
No. A problem site is a bank of problems and a judge. This trains the minute before you start typing, and keeps a record of how that minute goes.
Why pay for this when an LLM will just solve it?
An LLM will solve it and explain the solution well. Then the interview starts and the AI is switched off: 62% of companies still prohibit it (Karat, January 2026). Choosing the algorithm is the one skill an LLM takes off your hands while you practise.
I am starting from zero. Is this for me?
Yes, through the course rather than the trainer. Take the placement test and it will say which step to start at. If that is step 00, it explains what an algorithm is before anything else. The trainer starts paying off once you have patterns to confuse.
Is this for interviews or for real work?
Both. Every step names the production system its algorithm runs in, so it sticks past the interview and you stop relearning the same topics before every job hunt.
How much is free?
The placement test, with no account at all. Then the first 33 steps in full: lesson, runner, tests, progress. No card.
One payment, both halves.
The trainer and the course. No subscription, no renewal.
Join the free beta
Sign up now and get 60 days of full access, free.
Start with the one you cannot name.
Fifteen problems, about seven minutes, no account.
Take the placement testFrom the blog
Connected components: traversal from every unvisited node, or union-find
How to count components in O(V + E), when union-find beats a traversal, Python code for both, Number of Provinces, Graph Valid Tree and the mistakes.
2026-11-15
How to prepareLowest common ancestor: one recursion for a tree, one descent for a BST
The function returns the node it found or None, and a node with two answers is the ancestor. Python code for three variants, a traced run, node distance and the mistakes.
2026-11-13
How to prepareGreedy algorithm: how to know the greed is safe, plus three worked problems
The best local choice without undo, and the exchange argument that justifies it. Trigger words, Python code, interval scheduling, Jump Game, Gas Station and the mistakes.
2026-11-11