extensible, high-performance configuration management library, optimized for hierarchical data

Trie implementation, made for LeetCode. See readme.md for details

Generic prefix tree for golang

This project simulates a Type ahead feature with an in memory database(using Redis) which is similar to google's auto suggestion feature when typing in a search command. It is a complete standalone project which consists of backend which implements Trie and prefixweb which is used to call backend logic using REST API. --

Tree and Graph Data Structure

Efficient typo-tolerant search in 76 lines of code, with no dependencies.

Word processing engine built with trie data structure

Efficient, immutable and stack safe implementation of a Trie data structure in dart: autocomplete, text search, spell checking, strings and prefixes

Simple Trie Structure implementation in C++

Data Structures and Algorithms

A project for auto complete suggestion using trie data structure and debouncing useDebounce hook

A Double-array trie structure

A versatile and user-friendly text editor built in Java using Swing. This editor offers a range of features, from basic file operations to advanced text formatting and real-time spell-checking.

Fast Succinct Trie for Go. Support Marshalling

A Trie and DAFSA visualizer

Autocompletion Functionality

Word searching application written in python using the trie data structure

Trie base class and derived classes (TStringHashTrie, TIntegerHashTrie). A high performance and low memory footprint Dictionary set of classes

T9 Keyboard controled by numpad keyboard buttons

A multilingual, blazingly fast, offline dictionary for CS163 Final Project