Show HN: Algorithms and Data Structures in TypeScript – Free Book (~400 Pages)

Source: Hacker News

Overview

I started writing this book 10 years ago in JavaScript, got through a few chapters (asymptotic notation, basic techniques, start of sorting), and then abandoned it. Recently I picked it back up, converted everything to TypeScript, and used AI (Zenflow [1] + Claude Opus 4.6) to complete the remaining chapters. I provided the structure, direction, and initial chapters; the AI generated the bulk of the remaining content under a spec‑driven workflow.

Book Details

• Scope – Covers roughly a first 1–2 year CS curriculum: sorting, dynamic programming, graph algorithms, trees, heaps, hash tables, and more.
• Implementation – All code is executable, typed with generics/interfaces, and covered with tests.
• Review Status – I’ve thoroughly reviewed several chapters (sorting, DP, graphs) and done a high‑level pass on the rest. The book is currently in beta; corrections and contributions are welcome.
• License – MIT licensed.
• Inspiration – Inspired by Wirth’s Algorithms and Data Structures, SICP, and CLRS.

Repository

The code and tests are available on GitHub:

https://github.com/amoilanen/Algorithms-with-Typescript

References

1. Zenflow –

Comments URL: (Points: 5)