DSA Roadmap

Work through problems by category. Check them off as you go, your progress is saved locally, no sign-in required.

Your progress

Saved in this browser, no account needed.

0/322
Study list:

Arrays & Hashing

Hash maps, frequency counting, prefix sums, and matrix manipulation, the foundation.

Strings

Parsing, building, and transforming strings and substrings.

Two Pointers

Walk a sequence from both ends or at different speeds for O(n) solutions.

Sliding Window

Maintain a moving range to answer subarray/substring questions efficiently.

Stack & Queue

LIFO/FIFO thinking: matching, monotonic stacks, and ordered processing.

Binary Search

Halve the search space each step, on arrays and on answers.

Linked List

Pointer manipulation, fast/slow pointers, and in-place reversal.

Trees & Tries

DFS, BFS, and recursion over binary trees, BSTs, and tries.

Heap / Priority Queue

Always grab the smallest or largest next, top-K and scheduling problems.

Backtracking

Explore all candidates by building and undoing choices.

Graphs

Traversal, shortest paths, union-find, and topological order.

Dynamic Programming

Break problems into overlapping subproblems, the interview boss level.

Greedy

Make the locally optimal choice and prove it stays optimal.

Math & Geometry

Number theory, combinatorics, and geometric reasoning.

Bit Manipulation

Solve with XOR, masks, and bit tricks.