Practice

Seven steps on one lesson. Each answer is checked against the model: a prediction against its next frame, your code by running it on the lesson's input, the Break it cases and random inputs.

  1. Predict the next step

    The stage stops on the model's run. Pick what it shows next.

  2. Write the missing line, then fix a bug

    One line of the lesson's code is blank, then one has a classic slip in it.

  3. Write it yourself

    You get the signature. Your code runs in your browser.

Your practice so far →

Sliding Window

Two Pointers

Dynamic Programming

Backtracking

Graph Traversal (BFS & DFS)

Topological Sort

Heap / Priority Queue

Monotonic Stack

Prefix Sums

Hashing & Frequency Maps

Fast & Slow Pointers

Intervals