A String Searcher Program which was implemented using Trie Data Structure in Java as a group work. User can find strings start with given prefix, end with given suffix, start with given prefix and end with given suffix from a text file. The user can also check if the word is in the trie or not and find the top k words that have most occurrences.
Input/Output examples can be observed in the report.