Practical Algorithms and Data Structures

This repo is a work-in-progress port of Bradfield School of Computer Science's Practical Algorithms and Data Structures to TypeScript. That book is subject to a Creative Commons license (having itself been forked from another CC-licensed book), and the source code may be found here. The content of this repo is licensed in kind.

I have stuck reasonably close (but certainly not 100%) to the spirit of the Python implementations provided. But TypeScript is not Python, and I certainly have not matched expression-for-expression. For example, I had to make some typing decisions that are not necessary in the Python version, and insert type guards to accommodate static types.

Tests accompany the code, usually in the corresponding whatever.test.ts file. The tests assume the Deno runtime, because Deno provides a low-fuss way to get a TypeScript project running with testing batteries included 🦕 The full suite can be run from the project directory with deno test.

The non-test code is not particular to Deno, and it is suitable for transpiling to JavaScript with your favourite TypeScript toolchain. Most likely, you are here to read the code, not run it. None of these implementations should be considered robust, performant, or suitable for production use.

Hopefully these translations make the book just a little bit more accessible to folks who know JS or TS, but not Python. 🙃

Table of contents

The numbers refer to the corresponding sections of the book.

Analysis

3. An Anagram Detection Example

Stacks

2. A Stack Implementation
3. Balanced Parentheses
4. Converting Number Bases
5. Infix, Prefix and Postfix Expressions

Queues

2. A Queue Implementation
3. Simulating Hot Potato

Deques

2. A Deque Implementation
3. Palindrome Checker

Lists

2. An Unordered List Implementation
3. An Ordered List Implementation

Recursion

2. Calculating the Sum of a List of Numbers
3. Converting an Integer to Any Base
4. Tower of Hanoi
5. Dynamic Programming