COllapsed and COmpressed trie: a data-aware compressed string dictionary

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).

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.

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 multilingual, blazingly fast, offline dictionary for CS163 Final Project

A solver for boggle word game.

Trie is a tree-based data structure, which is used for efficient retrieval of a key in a large dataset of strings.

This projects implements the Trie Data Structure which create an autocomplete feature

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

A collection of C++ implementations of some complex data structures

Simple Trie Structure implementation in C++

Recursively implemented a Trie Data Structure to support various word manipulations including Autocomplete. A trie is a 26-ary tree where the root node represents an empty string “” and if the kth (k going from 0 to 25) subtree is not a null subtree, it represents a string that is the concatenation of the characters represented by the parent and…

Leetcode solution

A trie, also called digital tree or prefix tree, is a type of search tree, a tree data structure used for locating specific keys from within a set. These keys are most often strings, with links between nodes defined not by the entire key, but by individual characters. In order to access a key (to recover its value, change it, or remove it), the …

This C++ program finds the longest and second-longest compound words from a list of words. It utilizes a Trie data structure to efficiently determine if a word can be formed by concatenating other words from the list.

Program to auto-complete the words, implemented in C++

Coding Ninjas CPP DSA repository

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.