4 Topics Available

Data Structures

Linear and non-linear memory abstractions, self-balancing search trees, hash table collision resolution, and graph storage models.

1Linear Memory Abstractions & Dynamic Arrays

Contiguous vs linked memory layout, dynamic array resizing amortization, and doubly linked list memory overhead.

Linear Memory Abstractions & Dynamic Arrays

Contiguous vs linked memory layout, dynamic array resizing amortization, and doubly linked list memory overhead.

Linear Memory Abstractions & Dynamic Arrays

Contiguous vs linked memory layout, dynamic array resizing amortization, and doubly linked list memory overhead.

2Self-Balancing Search Trees & Heap Topologies

Binary search trees, AVL rotations, Red-Black tree invariants, and binary max/min heap properties.

Balanced Search Trees, Height Invariants & Tree Rotation Mechanics

AVL tree balance factors, single/double rotations, Red-Black tree black-height proofs, and priority queue binary heaps.

AVL Tree Height Invariants, Left-Right Rotations & Red-Black Balancing Mechanics

Master tree height degeneration, AVL balance factor maintenance, single and double tree rotation mechanics, and Red-Black tree black-height invariants and recoloring algorithms.

3Hash Tables & Collision Resolution Mechanics

Hash function uniform distribution, open addressing, separate chaining, Robin Hood hashing, and Cuckoo hashing.

Hash Functions, Open Addressing & Robin Hood Hashing

Universal hashing, primary/secondary clustering, tombstone deletion, Robin Hood probe stealing, and cuckoo eviction cycles.

Hash Dispersion, Tombstone Deletion, Robin Hood Hashing & Cuckoo Eviction Networks

Master hash function dispersion, universal hashing families, open addressing clustering dynamics, tombstone deletion markers, Robin Hood probe sequence length equalization, and Cuckoo hashing worst-case O(1) lookups.

4Graph Representations & Advanced Heap Topologies

Adjacency matrices vs lists, Fibonacci heaps, and Disjoint Set Union (DSU) with path compression.

Union-Find Inverse Ackermann, Fibonacci Heaps & Spatial Partitioning

Disjoint set union by rank, path compression, Fibonacci heap O(1) decrease-key, and spatial Kd-Tree partitioning.

Disjoint-Set Union with Path Compression, Fibonacci Heaps & Spatial Kd-Trees

Master the Disjoint-Set Union (Union-Find) data structure, union by rank and path compression heuristics, Tarjan's Inverse Ackermann proof, Fibonacci Heap amortized O(1) decrease-key operations, and multi-dimensional spatial Kd-Trees.