Pick your path
DSA interview roadmaps
Every other list gives all 370 problems in one fixed order. Here, the same problems are re-sequenced by the role you're targeting: a frontend path looks nothing like a data-engineering one. Free to explore; sign up to track your progress.
SDE / Software EngineerThe broadest DSA bar: trees, graphs, and DP show up mostArraysStringsLinked List260 core problemsBackend EngineerBackend rounds keep coming back to the same few problems: an LRU cache, a rate limiter, meeting rooms, top-K and job queuesArraysStringsLinked List167 core problemsFrontend EngineerFrontend loops lean arrays, strings & two-pointersArraysStringsTwo Pointers84 core problemsFull-Stack DeveloperBlends frontend array/string basics with backend system-design questionsArraysStringsTwo Pointers97 core problemsData EngineerHeavy on arrays, sorting, and math for ETL-style problemsArraysSortingMath117 core problemsML EngineerMath and DP-flavored optimization outweigh graph-heavy topicsArraysMatrixMath125 core problemsAndroid DeveloperArrays, strings, and recursion dominateArraysStringsTwo Pointers89 core problemsiOS DeveloperArrays, strings, and recursion dominateArraysStringsTwo Pointers89 core problemsSDET / QA EngineerSDET rounds test core DSA + edge-case thinkingArraysStringsTwo Pointers96 core problemsData AnalystSQL and array/math manipulation matter far more than trees or graphsArraysMathSorting64 core problemsGame DeveloperVector/collision math and transform matrices dominate, with graph search and heaps for pathfinding AIMathMatrixArrays130 core problemsGraphics EngineerLinear algebra, bit-level format packing, and BVH/kd-tree traversal carry the loopMathMatrixBit Manipulation108 core problemsEmbedded / Firmware EngineerRegister bit-twiddling, fixed buffers, ring queues, and intrusive linked lists are the barBit ManipulationArraysLinked List99 core problemsSecurity EngineerInput parsing, signature tries, CIDR/port interval merging, and stack-layout reasoning define these loopsStringsArraysBit Manipulation145 core problemsCryptography EngineerModular arithmetic, GF(2) bit operations, and fast exponentiation are the whole interviewMathBit ManipulationArrays91 core problemsPerformance EngineerCache-friendly array layout, sorting, top-k heaps, and rolling-window latency math matter more than any tree or backtracking topicArraysSortingBinary Search95 core problemsSite Reliability EngineerDependency graphs, alert heaps, outage intervals, and rate-limit windows mirror real incident workGraphHeapIntervals119 core problemsCloud EngineerCIDR bitmask arithmetic, resource dependency DAGs, longest-prefix routing tries, and bin-packing greedy questionsGraphIntervalsBit Manipulation144 core problemsSearch EngineerPrefix tries, posting-list intersection, skip-pointer binary search, and top-k heaps: the index-serving side of search, where linked lists and trees barely appearTrieStringsHeap107 core problemsInformation Retrieval EngineerRanking math, term-document matrices, and edit-distance DP lead here: the relevance side rather than the index plumbing a Search Engineer is grilled onStringsHeapSorting144 core problemsDatabase EngineerB-tree/index search, external sorting, index tries, and DP join-order planning are the actual jobBinary SearchSortingBST121 core problemsStorage EngineerBitmap allocators, extent intervals, LSM merge heaps, and free-list pointer work: the layout and durability layer beneath the query planner a DB engineer ownsBit ManipulationIntervalsHeap103 core problemsComputer Vision EngineerImages are matrices, so linear algebra, kernel windows, flood-fill graph traversal, and stereo/seam DP dominateMatrixMathArrays165 core problemsNLP EngineerTokenizer tries, Viterbi/edit-distance DP, beam-search heaps, and parse-tree recursion: string-heavy in exactly the way computer vision is notStringsTrieDynamic Programming147 core problemsRobotics EngineerMotion planning is graph search plus kinematics math and rotation matrices, with priority queues driving A*/DijkstraGraphMathMatrix131 core problemsCompiler / PL EngineerParsing builds and walks trees (ASTs), optimization is graph and dataflow analysis, and evaluation leans on stacks and recursionBinary TreesRecursionStack154 core problemsQuant DeveloperPricing and optimisation are DP, time-series work is array and sliding-window math, and combinatorics leans on number theoryMathDynamic ProgrammingArrays119 core problemsBlockchain / Web3 EngineerMerkle trees, hash-linked structures, and GF(2)/modular bit math define the loop, with consensus modelled as graphsBinary TreesBit ManipulationMath136 core problemsBioinformatics EngineerSequence alignment is edit-distance DP over strings, k-mer indexing is tries and hashing, and assembly is graph traversal: string- and DP-heavy in a way few other roles areStringsDynamic ProgrammingTwo Pointers88 core problemsNetworking EngineerRouting is graph shortest-path, IP lookup is longest-prefix tries, and packet scheduling is heaps, queues, and greedy interval workGraphTrieGreedy76 core problems