The project is implemented using the Trie data structure, which allows managing 10 billion unique contacts and retrieving any contact in constant time complexity. The project supports pattern-matching in searching contacts and provides a list view of all matched contacts.
A simple Blossom Player
A simple Trie implementation in C with and without Hashing (WIP)
Implemention of Trie datastructure in Java & Use it to create an application to store strings and get suggestion list for any prefix string.
Trie implementation, made for LeetCode. See readme.md for details
First year project at ITU - Parse n' read map of Denmark
Talleres entregables de la materia Algoritmos y Estructuras de datos 1
Realization of the prefix tree
Autocomplete dictionary using trie data structure.
ByteTrie - Implementation Trie algorithm for bytes in Go with memory optimization.
Version 2 of a playable scrabble-like game with an AI opponent
A solver for the popular word-finding game Squaredle (https://squaredle.app) Available at https://minoli-g.github.io/squaredle-solver/
Add a description, image, and links to the trie-datastructure topic page so that developers can more easily learn about it.
To associate your repository with the trie-datastructure topic, visit your repo's landing page and select "manage topics."