GridLex is a lightning-fast word search tool designed for grids of letters. With its powerful Depth-First Search (DFS) algorithm and Trie-based word lookup, GridLex efficiently hunts down valid words in any direction—up, down, sideways, or diagonal. Perfect for word puzzle enthusiasts, game developers, or anyone working with word grids

This repository contains a collection of essential data structures implemented in C and C++, designed to provide clear, efficient, and well-documented code for both linear and non-linear data structures. It includes implementations for trees such as Binary Tree, Binary Search Tree, AVL Tree, M-way Search Tree, B Tree, and B+ Tree, as well as graph.

Solved Algorithm & Data Structure problems for Infoarena.ro, the biggest Romanian online community helping thousands of young students learn and train for national and international Computer Science contests, supported by a team of former Olympic students.

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

Just for the preperation of Take Of Interview of Brototype. Topics that useful for the Brocamp students.

A TypeScript Trie data structure for efficient word insertion, lookup, deletion, traversal, and autocomplete features.

🎄 Generic trie data structure (prefix tree) in Rust, with functions to search for common prefixes and postfixes

SimpleTextEditor based on tree structure with java language

Home of LoycCore, the LES language of Loyc trees, the Enhanced C# parser, the LeMP macro preprocessor, and the LLLPG parser generator.

A basic city finder app. The user can search for cities and clicking on a city opens Google Maps and navigates to that city's location.

PCOM (Communication Networks) Assignment 1 in C

NFS for users to manage their system storage files and directories

A simple tool to help you find words in Wordament puzzles using OpenCV.

advanced programming course focused on C++ programming (C++23)

This project implements a 26-way Trie data structure to manipulate and manage strings efficiently.Then inserts all words to the trie from the given txt file.

This project provides service logic for managing contacts, including add, delete,prefix search etc with database support & Trie data structure implementation for these services without Database too.

A simple full-text search engine application with customizable user interface.

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.

基于Trie树和并行式优化的英文文本词频统计