GCD + Euclidean algorithm
Find the longest common subsequence.
Computes the greatest common divisor (gcd).
compute the greatest common divisor using euclid's algorithm
Compute the greatest common divisor (gcd).
A algorithm based on minimax search and alpha-beta prune to solve gomoku game.
Typescript implementation of queues, such as priority queue and circular queue.
Dancing link + Algorithm X
Knuth shuffle
A efficient Sudoku solver and creator.
Calculates the greatest common divisor of two integers.
Knuth shuffle
A Base64 encoding implementation.
The dinic algorithm implemented in typescript
Priority queue.
TypeScript definitions for compute-gcd
huffman + Euclidean algorithm
Sliding window
Dijkstra algorithm optimized with priority queue.
Common types for the algorithm.ts packages.
Find set written in Typescript.
Find the index of first elements which greater or equals than the target element.
Bellman-ford algorithm.
Find the index of first elements which greater or equals than the target element.