Summary

This section will summarize the concepts learned in the whole course.

We learned the following about tries:

• The intuition behind tries.

• Implementation of a trie.

• Visualization of a trie.

• The concept of tries as a data structure.

• Problem solving using tries.

Problem identification based on patterns

The list below describes the patterns contained in this course.

• Prefix searching: Tries are popularly known as prefix trees. They're used to solve a variety of prefix-searching and prefix-matching problems. This pattern introduced you to solving problems that involve detecting full or partial matches in strings, finding shared prefixes between multiple strings, finding or counting the number of words containing a prefix, and replacing matching words with another phrase.