Master algorithms and data structures with step‑by‑step visualizations.
Algorithms and structures for representing and traversing networks of nodes and edges.
Techniques for manipulating integers, including primality testing and modular arithmetic.
Methods for locating specific elements or states within data, such as binary search or depth‑first search.
Procedures for ordering collections of items, like quicksort, mergesort, or heap sort.
