A developer has released a comprehensive free book covering algorithms and data structures in TypeScript, spanning approximately 400 pages. The project began 10 years ago in JavaScript, covering initial topics like asymptotic notation and basic sorting techniques before being abandoned. Recently revived, the author converted all content to TypeScript and used AI tools including Zenflow and Claude Opus 4.6 to complete the remaining chapters.

The book follows a standard computer science curriculum structure, covering sorting algorithms, dynamic programming, graph algorithms, trees, heaps, and hash tables. All implementations are executable, use TypeScript generics and interfaces, and include comprehensive test coverage. The author has thoroughly reviewed several chapters including sorting, dynamic programming, and graph algorithms, with the book currently in beta and accepting contributions.

Inspired by classic texts like Wirth's "Algorithms and Data Structures", SICP, and CLRS, the book aims to bridge the gap between theoretical computer science education and practical software engineering. It targets both software engineers seeking to solidify their understanding and computer science students preparing for algorithms courses. The complete source code and tests are available on GitHub, with implementations written in TypeScript 5 using strict mode and tested with Vitest.