Course Overview
Get an overview of the objectives, contents, and prerequisites of this course.
We'll cover the following...
Tries
A trie is an efficient tree-like data structure to store and retrieve information. It operates on associative data structures, primarily strings. In this course, we'll learn the intuition behind the data structure, its usage, and practical applications, and we'll solve coding problems using tries.
Why do we need to know about tries?
Tries are advanced data structures. A software professional or a computer science enthusiast must know about tries for the following reasons:
Reason | Detail |
Enhanced knowledge of data structures | Tries are an advanced version of the primary data structure of tree. Understanding tries enhances knowledge of data structures. It also helps build strong thinking capability and intuition of leveraging primary data structures and modifying them to solve harder and more complex problems. |
Ace coding interviews | Trie-based problems are frequently given in coding interviews. Therefore a software professional or a computer science enthusiast needs proper knowledge of tries to ace coding and system design interviews. |
Understand real-life complex software systems | Real-life software like file systems, search engines, data analysis software, pattern matching programs, and genome analysis modules are built with tries in their backend. |
What does this course contain?
This course covers every aspect of the trie data structure, from the intuition of building a trie to coding it in two different programming languages, for solving algorithmic and real-world problems.
This course categorizes similar problems together and calls those categories patterns. These patterns will help us map a new problem to a known problem and solve it using tries. The problems are of varying difficulties, from easy to hard, so we may have an iterative learning experience. By the end of this course, we'll be able to decode relevant trie problems.
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 introduces us to solving problems that involve detecting full or partial matches in strings, finding shared prefixes between multiple ...