A solver for the popular word-finding game Squaredle (https://squaredle.app) Available at https://minoli-g.github.io/squaredle-solver/

First year project at ITU - Parse n' read map of Denmark

Version 2 of a playable scrabble-like game with an AI opponent

Realization of the prefix tree

A simple Blossom Player

A simple Trie implementation in C with and without Hashing (WIP)

My PRs: https://github.com/users/Ramy-Badr-Ahmed/projects/7

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.

Implemention of Trie datastructure in Java & Use it to create an application to store strings and get suggestion list for any prefix string.

Implementation of Trie datastructure using c++

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

Talleres entregables de la materia Algoritmos y Estructuras de datos 1

Autocomplete dictionary using trie data structure.

ByteTrie - Implementation Trie algorithm for bytes in Go with memory optimization.