// the find
yangshun/lago
📕 Data Structures and Algorithms library in TypeScript and JavaScript
A TypeScript reimplementation of classic data structures (lists, tries, heaps, AVL trees, graphs) and graph/sorting algorithms (Dijkstra, Bellman-Ford, topological sort), built by the GreatFrontEnd/Tech Interview Handbook author. It's aimed at people studying for coding interviews or wanting typed reference implementations to read, not at teams looking for a dependency to import.
Every data structure and algorithm has a matching test file, so you can trust the implementations rather than just eyeballing them. One class per file with consistent naming makes it easy to jump straight to the thing you want (e.g. src/data-structures/AVLTree.ts) instead of digging through a monolithic algorithms.js. Coverage goes past the usual interview-prep set into things like Bloom Filter, Disjoint-set, and NDArray that most similar repos skip.
No npm publish step or install instructions in the README — you're expected to copy files out rather than add it as a dependency, which the README never states outright. Last push was May 2024, and the two 'Help Wanted' entries (Suffix Tree, Segment Tree) are still unimplemented over a year later. Zero documentation on time/space complexity per structure, so as a study resource you still need an outside source to know what you're looking at.