Skip to content
Product /

How the DSA roadmap works

Data structures and algorithms, in order.

Nineteen stages in four tiers over about 150 curated problems. A stage opens when the one before it is cleared; a tier ends in a chest of XP and bonus interviews. The map knows where you are because the judge does.

Roadmap

Tier 2 of 4 · Core techniques

2 of 4 cleared

Sliding Window

8 / 8

Prefix Sums

6 / 8

→

Stacks

3 / 8 · open

Binary Search

locked

Tier chest

opens when every stage is cleared

Problems

34

Accepted

19

Chest

+50 XP · +1 interview

What is the CodeKairo DSA roadmap?

The roadmap is a guided route through data structures and algorithms: 19 stages in four tiers — Foundations, Core techniques, Advanced, Mastery — over about 150 curated problems, from Arrays 101 and Hashing through Binary Search, Heaps and Graphs to Dynamic Programming and a Capstone. A stage opens when the one before it is cleared, and clearing means accepted submissions on its required problems, usually six of eight — derived from your real submissions wherever they were made. Every tier ends in a chest that pays XP to both XP and rating plus one to three bonus mock interviews; the last one unlocks a certificate. Every stage also teaches: about 35 tutorials, from Big-O notation and Two Pointers to Dijkstra's Algorithm and the 0/1 Knapsack Problem, each with a dry run and runnable code in C++, Java, Python and JavaScript, open without an account. Free on every plan.

19

stages

4

tiers

~150

curated problems

4

chests

01

How it works

Clear a stage. The next one opens.

The road is the catalogue's problems in a teaching order — Arrays 101, Hashing, Strings, Two Pointers, Sliding Window, then on through Binary Search, Heaps, Graphs and Dynamic Programming to a Capstone. Each stage asks for accepted submissions on its required problems, usually six of eight, and nothing is stored about where you are: your standing is read from your real submissions every time, wherever they were made.

So a problem solved in a duel, in the daily contest or from a pair room advances the road as much as one solved from the map — and a tier you cleared before chests existed pays out the next time you visit.

Who it is for

Anyone who has opened a problem list, not known where to start, and closed it. The road answers that with an order — and with a lock that keeps the next stage shut until the current one is actually learned, not skimmed.

  • 01

    Read the stage's tutorial

    Each stage lists its lessons above its problems — the idea, why it works, a dry run, code in four languages and what to practise. Lessons are never locked, so you can read ahead.

  • 02

    Start at Arrays 101

    The first stage is open. Its problems are the same problems as the catalogue's — solve them from the road, the catalogue, a duel or a pair room; every accepted submission counts.

  • 03

    Clear a stage to open the next

    Usually six accepted problems of eight. The map lights the road forward and a notification names what just unlocked.

  • 04

    Open the chest

    Clear every stage in a tier and its chest opens: 30, 50, 80 or 100 XP to both XP and rating, one to three bonus interviews that never expire, a badge on your profile and a frame around your avatar.

  • 05

    Take the certificate

    The last chest unlocks an A4 certificate naming you, the completion date and the date each tier was cleared, exported from the site as a PNG.

02

Why a lock, and why a chest

The lock is the teaching

A problem list with everything open is a list you skim. A stage that stays shut until the one before it is actually cleared makes the order mean something — and keeps Dynamic Programming out of reach until the tools it needs are in hand.

The chest is the receipt

Every tier ends in one: 30, 50, 80 or 100 XP paid to both XP and rating, and one to three bonus mock interviews that never expire. Each opened chest is a badge on your profile and a frame around your avatar.

The certificate is the end

The last chest unlocks an A4 certificate naming you, the completion date and the date each tier was cleared. It is drawn in the browser from your own record and exported as a PNG — nothing to request, nothing to wait for.

03

Questions

What is on the road?

How does a stage unlock?

What is in a chest?

Is there a certificate?

Does the roadmap teach the topics too?

Start at Arrays 101.

Nineteen stages, four chests, one certificate — free on every plan.

How the DSA roadmap works

Data structures and algorithms in the order to learn them: 19 stages over about 150 curated problems, each unlocking the next, and a chest after every tier.

What is the CodeKairo DSA roadmap?

The roadmap is a guided route through data structures and algorithms: 19 stages in four tiers — Foundations, Core techniques, Advanced, Mastery — over about 150 curated problems, from Arrays 101 and Hashing through Binary Search, Heaps and Graphs to Dynamic Programming and a Capstone. A stage opens when the one before it is cleared, and clearing means accepted submissions on its required problems, usually six of eight — derived from your real submissions wherever they were made. Every tier ends in a chest that pays XP to both XP and rating plus one to three bonus mock interviews; the last one unlocks a certificate. Every stage also teaches: about 35 tutorials, from Big-O notation and Two Pointers to Dijkstra's Algorithm and the 0/1 Knapsack Problem, each with a dry run and runnable code in C++, Java, Python and JavaScript, open without an account. Free on every plan.

How it works

  1. Read the stage's tutorial. Each stage lists its lessons above its problems — the idea, why it works, a dry run, code in four languages and what to practise. Lessons are never locked, so you can read ahead.
  2. Start at Arrays 101. The first stage is open. Its problems are the same problems as the catalogue's — solve them from the road, the catalogue, a duel or a pair room; every accepted submission counts.
  3. Clear a stage to open the next. Usually six accepted problems of eight. The map lights the road forward and a notification names what just unlocked.
  4. Open the chest. Clear every stage in a tier and its chest opens: 30, 50, 80 or 100 XP to both XP and rating, one to three bonus interviews that never expire, a badge on your profile and a frame around your avatar.
  5. Take the certificate. The last chest unlocks an A4 certificate naming you, the completion date and the date each tier was cleared, exported from the site as a PNG.

Who it is for

Anyone who has opened a problem list, not known where to start, and closed it. The road answers that with an order — and with a lock that keeps the next stage shut until the current one is actually learned, not skimmed.

Frequently asked questions

What is on the road?
Four tiers — Foundations, Core techniques, Advanced and Mastery — holding 19 stages: Arrays 101, Hashing, Strings, Two Pointers, Sliding Window, Prefix Sums, Stacks, Binary Search, Sorting & Greedy, Intervals, Heaps, Matrix & Grids, Bit Manipulation, Recursion & Backtracking, two Graphs stages, two Dynamic Programming stages and a Capstone. About 150 problems in all.
How does a stage unlock?
By clearing the one before it. A stage is cleared once you have accepted submissions on its required number of problems — usually 6 of 8. Progress is derived from your real submissions: a solve made from the catalogue, a duel, the daily contest or a pair room counts too.
What is in a chest?
Every tier ends in one. It opens the moment every stage in the tier is cleared and pays, once, the tier's XP (30, 50, 80 or 100) to both XP and rating, plus one to three bonus mock-interview sessions that never expire. Each opened chest is a badge on your profile and a frame around your avatar.
Is there a certificate?
Yes, once the last chest is open: an A4 certificate naming you, the completion date and the date each tier was cleared, exported as a PNG from the site.
Does the roadmap teach the topics too?
Yes. Every stage has its lessons — about 35 tutorials such as Two Pointers Technique, Sliding Window, Binary Search, Greedy Algorithms, Dijkstra's Algorithm and Dynamic Programming. Each explains the idea and why it works, traces an example step by step, and shows runnable code in C++, Java, Python and JavaScript. Lessons are free, need no account and are never locked.