Learning paths

Learn it in order.

One path per subject, covering every page in it, in an order where nothing is used before it's taught. Problems come right after the last idea they need. Open any step whenever you like; the path just tells you what to read first.

Your tracksHLDLLDDSA
HLD

System design

not started

Problem by problem: each one comes right after the pages it needs.

0 of 123 steps22 h in all

First problem: Scale from zero to millions, after 13 pages, about 2 h.

First step · 1How to approach a system designarticle · 11 minStart
35 problems4 live problems31 planned
See the whole path
LLD

Low-level design

not started

Problem by problem: each one comes right after the pages it needs.

0 of 75 steps10 h in all

First problem: Tic-tac-toe, after 7 pages, about 55 min.

First step · 1What low-level design isarticle · 8 minStart
12 problems2 live problems10 planned
See the whole path
DSA

Data structures & algorithms

not started

Problem by problem: each one comes right after the pages it needs.

0 of 44 steps4 h in all

First problem: Two Sum, after 4 pages, about 29 min.

First step · 1Big-O notation & analysisarticle · 7 minStart
35 problems35 planned
See the whole path

Every page, in order

Each path covers every page of its subject, in an order where every page builds only on pages before it. What a problem doesn't need yet comes later.

Problems where they fit

Problems come easiest first, each right after the pages it needs, so the first one arrives within the hour. Problems we haven't built yet are shown as planned.

Progress you don't have to log

A page counts once you've read it, a system once you've watched it evolve, finished a walkthrough or fixed what you broke. You can mark any step yourself.