Level up from Big-O to segment trees.

The complete DSA roadmap, built like a game. Learn each idea, clear hand-picked LeetCode challenges, and ask Orbi, an AI tutor, whenever you're stuck.

29
levels
6
worlds
221
challenges
₹0
to use

Six worlds, climbed in order

Each world builds on the one before it. Hash maps come before sliding windows, recursion before trees, and trees before graphs.

  1. World 1: Foundations

    How to reason about cost, plus the three structures every other topic is built on: arrays, strings and hash maps.

    Meadow, 6 levels, about 26 hours
    0 of 6 cleared
  2. World 2: Core Patterns

    Reusable techniques — two pointers, windows, prefix sums, binary search — that turn O(n²) brute force into O(n) or O(n log n).

    Lagoon, 6 levels, about 25 hours
    0 of 6 cleared
  3. World 3: Linear Structures

    Linked lists, stacks and queues: pointer manipulation and the monotonic tricks behind many "next greater" problems.

    Lavender, 3 levels, about 12 hours
    0 of 3 cleared
  4. World 4: Trees & Heaps

    Hierarchical data: traversals, binary search trees, priority queues and prefix trees.

    Pinewood, 4 levels, about 17 hours
    0 of 4 cleared
  5. World 5: Graphs

    Model anything with nodes and edges: traversal, dependency ordering, connectivity and shortest paths.

    Crystal, 4 levels, about 18 hours
    0 of 4 cleared
  6. World 6: Mastery

    Search and optimisation: backtracking, greedy proofs, dynamic programming, bit tricks and range-query trees.

    Ember Peak, 6 levels, about 35 hours
    0 of 6 cleared

How a level works

Every topic is a level. Clear it and its tile turns gold on your map.

  1. Step 1

    Learn the ideas

    Short explanations, a complexity cheat sheet and a tested template in Python and C++. Tick each concept once you can explain it without notes.

  2. Step 2

    Clear the challenges

    Hand-picked LeetCode problems from easy to hard. Know every concept and solve three problems to clear the level.

  3. Step 3

    Keep your streak

    XP takes you from Cadet to Orbit Master. Tick one thing a day to grow your streak, and ask the tutor whenever you're stuck.

Stuck? Ask Orbi.

Paste a problem or your code and choose how much help you want. In hint mode Orbi nudges you toward the next step instead of handing over the answer, so you still learn the pattern.

  • HintThe next step, never the full solution
  • ExplainA concept, taught with a small example
  • ReviewBugs and complexity issues in your code
Ask the tutor
YouMy Two Sum uses two loops and times out at n = 10⁵. What am I missing?
Orbi, hint mode

Your inner loop is hunting for one value: target − nums[i]. Which structure answers "have I seen this before?" in O(1)?

Store each number's index as you go, and check before you insert.

Level 1 takes about three hours.

Start with Big-O: it decides which algorithm you pick for everything after it.

Start level 1