trie-datastructure

There are 11 repositories under trie-datastructure topic.

  • minoli-g/squaredle-solver

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

    Language:JavaScript8221

  • dee-tree/Trie

    Realization of the prefix tree

    Language:Java1140

  • johannes67890/MinionMap

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

    Language:Java10

  • nevehallon/word-game-V2

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

    Language:TypeScript1201

  • Japkeerat/Blossom-Player

    A simple Blossom Player

    Language:Python0100

  • rakshith-crm/Contact-Manager

    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.

    Language:C++0100

  • satyy/trie-app

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

    Language:Java0200

  • spflaumer/hash-trie

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

    Language:C0100

  • abdullahfarwees/Trie

    Implementation of Trie datastructure using c++

    Language:C++20

  • FreezeLogic/ByteTrie

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

    Language:Go

  • thatbeautifuldream/autocomplete-dictionary

    Autocomplete dictionary using trie data structure.

    Language:JavaScript