Pebellslearn by building
RoadmapsMatrixCoursesSandboxSign in
All roadmaps

Data Structures & Algorithms Roadmap

Build concepts in dependency order — not just chapter order.

0 / 62 concepts0% complete
Continue learning Next: Conditionals
Foundations10 conceptsLinear Structures3 conceptsRecursion & Sorting4 conceptsTrees & Heaps4 conceptsGraphs5 conceptsAlgorithm Design4 conceptsAnalysis II4 conceptsBits8 conceptsNumber Theory3 conceptsRanges2 conceptsStrings3 conceptsBalanced Trees1 conceptSequence DP1 conceptProbabilistic & Systems2 conceptsGraph Structure2 conceptsFlow & Matching1 conceptGeometry3 conceptsHard Problems2 conceptsConditionalsArithmetic & roundingLoopsLists & tuplesBig-O & complexityDictionariesSetsArraysTwo pointers & sliding win…Hash tablesStacksQueues & dequesLinked listsRecursionBuilt-in functionsSortingSearchingBinary treesTriesHeaps & priority queuesBinary search treesComprehensionsGraphsUnion-findGraph traversalShortest pathsfunctoolsBacktrackingDynamic programmingGreedy algorithmsCorrelation & regressionLogarithmsDivide & conquerRandomised algorithmsDivisibility & primesNumber systemsPowers & scientific notati…Numerical methodsMatricesBit manipulationNumber theory for algorith…Probabilistic structuresCombinatoricsProbabilityModular arithmeticRange queriesBalanced treesStringsString matchingSuffix structuresSpatial treesGuard clausesCache policiesStructures at scaleGraph decompositionMinimum spanning treesNetwork flowArea & volumeVectorsComputational geometryAdversarial searchIntractability
100%