Data Structures & Algorithms Roadmap — 18 stations

This roadmap is interactive when JavaScript is enabled. Below is the full station list, grouped by track.

F1 Big-O & Complexity — time vs space, common growth classes, best/average/worst case. 30 min · Beginner
F2 Arrays & Strings — random access, in-place edits, reversals and rotations. 30 min · Beginner
F3 Hashing & Sets — hash maps, frequency counts, the two-sum pattern. 45 min · Beginner
F4 Two Pointers & Sliding Window — opposite-end and fast/slow pointers, variable windows. 45 min · Intermediate
F5 Math & Sieves — primes, GCD, modular arithmetic, the Sieve of Eratosthenes. 40 min · Intermediate
F6 Binary Search — sorted-array search, lower/upper bound, search on the answer. 45 min · Intermediate

T1 Stacks & Queues — LIFO, FIFO, monotonic stack, matching and parsing. 30 min · Beginner
T2 Linked Lists — pointer reversal, Floyd cycle detection, the dummy-head trick. 40 min · Intermediate
T3 Recursion & Backtracking — base cases, the call stack, try/recurse/undo, pruning. 50 min · Intermediate
T4 Sorting — divide & conquer, merge sort and quicksort, when to sort first. 50 min · Intermediate
T5 Trees & BSTs — the BST invariant, DFS traversals, balanced-tree intuition. 50 min · Intermediate
T6 Heaps & Priority Queues — min/max heaps, O(n) heapify, the top-k pattern. 45 min · Intermediate

P1 Graph Foundations — adjacency list vs matrix, directed/weighted edges, connectivity. 40 min · Intermediate
P2 BFS & Flood Fill — queue-based BFS, unweighted shortest path, flood fill. 45 min · Intermediate
P3 DFS & Topological Sort — recursive/iterative DFS, cycle detection, scheduling. 45 min · Intermediate
P4 Shortest Paths — weighted edges, Dijkstra with a heap, relaxation. 55 min · Advanced
P5 Heuristic Search (A*) — admissible heuristics, f = g + h, A* vs Dijkstra. 50 min · Advanced
P6 Dynamic Programming — overlapping subproblems, memoisation vs tabulation, classic DPs. 60 min · Advanced