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.
Predict the next step
The stage stops on the model's run. Pick what it shows next.
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.
Write it yourself
You get the signature. Your code runs in your browser.
Sliding Window
Two Pointers
- Valid PalindromeEasy
- Two Sum II - Input Array Is SortedMedium
- 3SumMedium
- Container With Most WaterMedium
- Trapping Rain WaterHard
Binary Search
Dynamic Programming
- Climbing StairsEasy
- House RobberMedium
- Coin ChangeMedium
- Longest Increasing SubsequenceMedium
- Word BreakMedium
- Maximum SubarrayMedium
Backtracking
- SubsetsMedium
- Combination SumMedium
- PermutationsMedium
Graph Traversal (BFS & DFS)
Topological Sort
- Course ScheduleMedium
Heap / Priority Queue
Monotonic Stack
Prefix Sums
Hashing & Frequency Maps
- Two SumEasy
- Contains DuplicateEasy
- Valid AnagramEasy
- Group AnagramsMedium
- Longest Consecutive SequenceMedium
Fast & Slow Pointers
Intervals
- Merge IntervalsMedium
- Meeting Rooms IIMedium