...
/Introduction to Suffix Searching Using Tries
Introduction to Suffix Searching Using Tries
Get an introduction to suffix searching using tries.
What is a suffix?
A suffix, contrary to prefixes, is the ending substring of a word. Searching for suffixes is an everyday use case for tries, where the strings are generally inverted and inserted into the trie.
A prefix string is a substring of a string or word present at the beginning. Note that a suffix will become a prefix if the string is inverted. For example, for the word bake
, the valid prefixes are b
, ba
, bak
, and bake
, while the valid suffixes are bake
, ake
, ke
, and e
.
What is suffix searching?
Searching for the presence of a suffix in a string is called suffix searching. ...
Access this course and 1400+ top-rated courses and projects.