Home of LoycCore, the LES language of Loyc trees, the Enhanced C# parser, the LeMP macro preprocessor, and the LLLPG parser generator.

A fast and space efficient Radix tree in Java

COllapsed and COmpressed trie: a data-aware compressed string dictionary

Data Structure & Algorithm : This journey is not just about coding but also about developing problem-solving thinking, optimizing solutions, and building a strong foundation for coding interviews and real-world programming. So far i am loving it.

🟣 Trie Data Structure interview questions and answers to help you prepare for your next data structures and algorithms interview in 2026.

Next word prediction and word auto-complete for Android - with the power of Rust 🚀

Auto Complete / Suggestion feature using Trie data structure

Trie data structure implementation in TypeScript. Highly performant. No dependencies. Built for a Scrabble Solver.

A crossed platform desktop (dictionary) application written in Goa nd QT/QML 📗 🔥

Trie data structure implementation in Golang 🌳

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

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

🎄 Generic trie data structure (prefix tree) in Rust, with functions to search for common prefixes and postfixes

Python trie implementation, for educational purposes

Auto Suggestion Using Trie

The 4th assignment for AUT's Advanced Programming course (Spring 2025), focusing on the implementation and understanding of Bloom Filters and Tries. These structures optimize space and search operations, crucial for network systems and data processing.

3rd sem Data Structures project to implement a real world dictionary using Trie data structure.

A simple implementation of a Trie data structure to auto-complete words.

The third assignment for AUT's Advanced Programming course (Spring 2024), focusing on the implementation and understanding of Bloom Filters and Tries. These structures optimize space and search operations, crucial for network systems and data processing.

Simple Double Array Trie implementation