🚍 High-performance trie-node router.

Skip the JS and write server-side Parse CloudCode in Swift!

autocomplete function used search engines, spell-checking, text-messengers, etc. Includes a bloom filter that provides memory efficient check of whether an item has been inserted before through the use of hashing algorithms (FNV1AHash, CRCHash, and SBDMHash).

GoLang implementation for Tries

Implementation of a Patricia/radix tree data structure, storing a dictionary.

A Scrabbler which finds anagrams from input dictionary, finds prefix and sufix words.

A Trie data structure which can be searched using wild characters.

A collection of C++ implementations of some complex data structures

A Java Library that uses Trie structure to retrieve a K most recurring words

🌲Trie generator.

A Wikipedia sourced search engine

This project implements a text autocompletion system using Trie (prefix tree) data structure. The autocomplete functionality allows users to efficiently retrieve word suggestions as they type, making text input more efficient and user-friendly.

🔍 A React app with blazing fast sub millisecond autocomplete suggestions using a weighted trie.