Every DSA topic, organized. Expand to explore subtopics and track progress.
Contiguous memory, indexing, and the workhorse of DSA.
Pattern matching, hashing, and string algorithms.
Pointer manipulation and node-based structures.
LIFO structures and monotonic techniques.
FIFO structures, deques, and priority queues.
Hierarchical structures and traversals.
Nodes, edges, traversals, and shortest paths.
Overlapping subproblems and optimal substructure.
Locally optimal choices that build global solutions.
Logarithmic search over sorted spaces and answers.
Self-referential problem solving and backtracking.
Priority-based structures for top-K and streaming.
Bitwise operations and masks.
Number sense, primes, and combinatorics.
Advanced number theory results.
Computational geometry primitives.
Randomized, design, and implementation-heavy problems.