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

A Wikipedia sourced search engine

🌲Trie generator.

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

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 Trie data structure which can be searched using wild characters.

GoLang implementation for Tries

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

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

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

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).

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

🚍 High-performance trie-node router.