No coding experience required. This guide walks through the workspace, explains what every control does, and covers the handful of computer-science terms (like Big O) you'll see mentioned throughout the app.
Algorithm Lab is an interactive lab for learning the common patterns used to solve coding problems — things like Two Pointers, Sliding Window, and Binary Search.
Instead of reading static code, you watch the algorithm run one step at a time, scrub backward and forward through its history like a video, and read a plain-English explanation of exactly why each step happens.
You can also edit the input yourself and re-run the same algorithm to see how it adapts.
Click any box below to see what that part of the screen does. Every pattern page is laid out this way.
Big O describes how many extra operations an algorithm needs as the input gets bigger. It doesn't measure exact seconds — it measures the shape of the growth. A "faster" Big O means it stays efficient even when the input gets huge.
O(2ⁿ) and O(n!) grow too fast to plot on the same axis as the classes above — this second chart uses a log scale instead, so you can see both curves without one flattening the other.
Every pattern page shows its Big O time and space complexity in the Statistics panel, so you can connect what you're watching to the notation.
The classes above describe the growth curve. These describe the actual code shapes that produce each curve — recognizing the shape is usually faster than deriving Big O from scratch.
Space complexity measures extra memory an algorithm uses beyond its input, as that input grows. Here's what drives each common class in practice.
Two Pointers — Pair Sum is the friendliest place to start.
Start your first pattern