Trie
Find the longest common subsequence.
https://en.wikipedia.org/wiki/Trie
Unicode Trie data structure for fast character metadata lookup, ported from ICU
Trie Data Structure to support cspell.
Create and modify trie prefix structures, extract word lists including anagrams and sub-anagrams
Curated collection of data structures for the JavaScript/TypeScript.
This is an implementation of the modified merkle patricia tree as specified in Ethereum's yellow paper.
A trie implementation that maps keys to objects for rapid retrieval by phrases. Most common use will be for typeahead searches.
Fast and tiny fuzzy-search utility
Crazy fast http radix based router
A memoization algorithm in which each function argument represents a new key, creating a trie of caches as defined by the array in your first argument.
Implementation of the modified merkle patricia tree as specified in Ethereum's yellow paper.
Implementation of the modified merkle patricia tree as specified in Ethereum's yellow paper.
Strongly typed trie data structure for path and URL-like strings.
A algorithm based on minimax search and alpha-beta prune to solve gomoku game.
Knuth shuffle
Dancing link + Algorithm X
Typescript implementation of queues, such as priority queue and circular queue.
A efficient Sudoku solver and creator.
Radix trie module.
TypeScript definitions for unicode-trie
Provides fast access to unicode character properties
Check permissions using Shiro-like strings, put in a trie.