Algorhythm

The minimum data plumbing every ML pipeline needs - samples, features and labels, the train/val/test split, text encoding (ASCII and UTF-8), and preprocessing.

Maintain a deque of indices with strictly-monotonic values - the front evicts when the window slides past, the back drops what's dominated. The front is always the window's max in O(1).

Find the shortest route from a source to every other node. A family of four sub-patterns: unweighted BFS, Dijkstra, Bellman-Ford, Floyd-Warshall.

Build a balanced binary tree where each node holds the aggregate of a range - any range decomposes into O(log N) canonical pieces, so queries and point updates are both O(log N).

An algorithmic-thinking gym. Interactive animations that teach the mental model behind algorithm patterns - so you spend hours less staring at problems and more time recognizing the trick.