A Scrabbler which finds anagrams from input dictionary, finds prefix and sufix words.

A Trie data structure which can be searched using wild characters.

A Java Library that uses Trie structure to retrieve a K most recurring words

This project implements a text autocompletion system using Trie (prefix tree) data structure. The autocomplete functionality allows users to efficiently retrieve word suggestions as they type, making text input more efficient and user-friendly.