Deep-dive into contiguous and node-based sequences: arrays, dynamic arrays, strings, matrices, linked lists, stacks, queues, and priority queues.
Contiguous memory addressing proofs, cache lines, amortized doubling geometric series, and memory fragmentation.
String immutability, UTF-8 vs UTF-16, row-major vs column-major matrix flattening, cache-friendly traversals, and sparse matrices.
Node pointer architecture, in-place 3-pointer reversal invariants, fast/slow Floyd cycle detection mathematical proofs.
Bidirectional pointer maintenance, sentinel heads/tails, O(1) arbitrary node deletion, circular ring buffers, and Josephus problem.
Skip Lists probabilistic multi-level towers, Unrolled Linked Lists for B-tree cache locality, and memory-efficient XOR lists.
LIFO formal specification, array vs linked implementations, Dijkstra's Shunting-Yard expression parsing, and balanced brackets.
FIFO mechanics, array false-overflow failure mode, modulo arithmetic ring buffers, lock-free queue primitives.
Double-ended queues, sliding window maximums, priority queue abstract contracts, and comparing array vs heap vs BST implementations.