Trie data structure implementation in TypeScript. Highly performant. No dependencies. Built for a Scrabble Solver.
-
Updated
Jan 26, 2025 - TypeScript
Trie data structure implementation in TypeScript. Highly performant. No dependencies. Built for a Scrabble Solver.
Create and modify trie prefix structures and extract word lists including prefixes, anagrams and sub-anagrams
A project for auto complete suggestion using trie data structure and debouncing useDebounce hook
A Double-array trie structure
Add a description, image, and links to the trie-structure topic page so that developers can more easily learn about it.
To associate your repository with the trie-structure topic, visit your repo's landing page and select "manage topics."