Algorithms

Solving the classic string deduplication algorithm entirely within TypeScript’s type system using literal string types and recursive type manipulation.

A functional TypeScript implementation of Dijkstra’s classic algorithm for parsing mathematical expressions, converting infix notation to reverse Polish notation for stack-based evaluation.

We explore a solution to finding Pythagorean triples with a product constraint, achieving O(√n) time complexity by reducing the problem to the well-known 3SUM problem.