There are 1 repository under trie-data-structure topic.
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
🟣 Trie Data Structure interview questions and answers to help you prepare for your next data structures and algorithms interview in 2025.
Auto Complete / Suggestion feature using Trie data structure
Next word prediction and word auto-complete for Android - with the power of Rust 🚀
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 :green_book: :fire:
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
3rd sem Data Structures project to implement a real world dictionary using Trie data structure.
Auto Suggestion Using Trie
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.
A simple implementation of a Trie data structure to auto-complete words.
Simple Double Array Trie implementation
A distributed File Management Tool in C++, using processes, forking, named-pipes (FIFOs) and low-level I/O.
C program to find parts of speech in a given sentence
Auto Complete / Suggestion feature using Trie data structure
Algorithms and data structures implementation in Go
The sixth assignment for AUT's Basic Programming course (Fall 2024) emphasizes advanced C programming concepts. Students will implement a Trie data structure to practice dynamic memory allocation, structs, and file operations, and create a debugging macro for runtime error tracking with conditional logging.
A simple app to visualize word unscrambling algorithm with the trie data structure.
implement auto_suggest and auto_complete feature using "TRIE" in C++.
advanced programming course focused on C++ programming (C++23)
Browser is a compact web browser project aiming for simplicity and efficiency. Explore basic browsing functionalities, straightforward web browsing experience without unnecessary complexities.
Job sector is the ultimate destination for freelancers across the board. Discover a diverse array of projects, collaborate with clients, and take your freelance journey to new heights. Whether you're a creative, coder, or consultant, job sector opens doors to success.
Word suggestion is an npm module delivering intelligent word suggestions for enhanced text input in your applications. Elevate user experience with dynamic and context-aware suggestions, making content creation a breeze. Integrate word-suggestion to add a touch of efficiency to your projects.
My learning journey of Data Structures & Algorithms with practice and notes
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.
GeoHealth Analytics is a Python-based platform designed to enhance healthcare accessibility by utilizing advanced data structures such as R-trees, heaps, tries, and stacks. It provides efficient hospital searches, rankings, and detailed facility information, improving user experience and healthcare accessibility.
Prefix Trie data structure with Pattern Matching, in Rust
Search Engine based on Cranfield dataset