For extremely fast prefix/fuzzy string searches, a data structure and associated algorithms are required.
Create a Trie with:
Trie objName = new Trie();
Add with -> insert:
// insert can add information.
objName.insert("Search");
Search with -> search:
// search can look for added information.
objName.search("Search");
Delete with -> delete
// delete can delete added information
objName.delete("Search");
``` Java
objName.startsWith("Se");