trie-datastructure
Here are 11 public repositories matching this topic...
Implemention of Trie datastructure in Java & Use it to create an application to store strings and get suggestion list for any prefix string.
-
Updated
Dec 23, 2019 - Java
Realization of the prefix tree
-
Updated
Feb 11, 2021 - Java
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.
-
Updated
Apr 27, 2021 - C++
Autocomplete dictionary using trie data structure.
-
Updated
Jan 1, 2022 - JavaScript
ByteTrie - Implementation Trie algorithm for bytes in Go with memory optimization.
-
Updated
Oct 23, 2022 - Go
A simple Trie implementation in C with and without Hashing (WIP)
-
Updated
Jan 30, 2023 - C
A solver for the popular word-finding game Squaredle (https://squaredle.app) Available at https://minoli-g.github.io/squaredle-solver/
-
Updated
Apr 5, 2023 - JavaScript
A simple Blossom Player
-
Updated
Aug 1, 2023 - Python
Version 2 of a playable scrabble-like game with an AI opponent
-
Updated
Sep 24, 2023 - TypeScript
First year project at ITU - Parse n' read map of Denmark
-
Updated
May 14, 2024 - Java
Improve this page
Add a description, image, and links to the trie-datastructure topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the trie-datastructure topic, visit your repo's landing page and select "manage topics."