Data Structures and Algorithms

Create and modify trie prefix structures and extract word lists including prefixes, anagrams and sub-anagrams

Checking if a word is a real word (Available in English & French)

A versatile and user-friendly text editor built in Java using Swing. This editor offers a range of features, from basic file operations to advanced text formatting and real-time spell-checking.

System Programming. Implementation of Search Engine using a Trie structure

Dictionary using trie

Word processing engine built with trie data structure

autocomplete text app with cpp GUI QT

Coursera course: Algorithms on Strings

An implementation of the wordBreak problem to split into all possible combinations of words that the original sentence could have been made up of. Takes the input from a file and outputs it to shell.

A Wikipedia sourced search engine

Lightweight javascript library for tree data structures.

A simple word auto complete feature implemented using Trie Data Structure in C++.

Implementation of Code Auto-Completion and Spell-Checking using Tries and Ternary Tries.

Implement Trie model for adding and searching words in C++

Implementation of the Autosuggest feature using Trie Data structure

Implementation of a simple trie data structure, capable of storing strings of lowercase characters.

This is project of Trie data structure.That include functionality like add word , search particular word and enter short word and find next possible words. This project is console base project.

Given replace map, we can replace all the correspond words in input file without wrong twice replace.