Data Structures & Algorithms

Big-O, recurrences, amortized bounds, memory, and constant factors.

Dynamic arrays, linked lists, deques, stacks, queues, two pointers, and prefix sums.

Comparison and linear-time sorts, library sorts, binary search, and selection.

Collisions, load factor and rehashing, hash functions, and hash flooding.

Tree traversal, BSTs and balancing, heaps and priority queues, and B-trees.

Reading problems, constraints, observations, proofs, testing, debugging, and practice.

Backtracking, greedy, divide and conquer, DP, and binary search on answers.

Traversal, DAGs, shortest paths, spanning trees, connectivity, and flow.

String costs, KMP and Z, rolling hashes, tries, and suffix structures.

Union-find, Fenwick and segment trees, sparse tables and LCA, and randomized structures.