Advanced Data Structures: Implementing Tries in C++ and Java

This course covers the intuition, implementation and problem-solving using tries.

Intermediate

66 Lessons

19h

Certificate of Completion

This course covers the intuition, implementation and problem-solving using tries.

AI-POWERED

Explanations

AI-POWERED

Explanations

This course includes

51 Challenges

This course includes

51 Challenges

Course Overview

Trie is an efficient tree-like data structure used to store and retrieve information. It is frequently tested in coding interviews, indicating its widespread use in solving many real-world software engineering challenges. This course covers every aspect of the trie data structure, from the intuition of building a trie to coding it in famous programming languages for solving algorithmic problems and designing real-world systems. It assumes a prior knowledge of trees and basic data structures like lists and ...Show More

What You'll Learn

An understanding of the use of tries and their implementation in C++ and Java

Ability to solve trie-based coding challenges frequently encountered in coding interviews

Familiarity with various patterns under which a trie related problem can fall

Hands-on practice working with real-world use cases of tries

Familiarity with a few case studies for a better understanding of system design concepts

What You'll Learn

An understanding of the use of tries and their implementation in C++ and Java

Course Content

Introduction to Tries

Course Overview

Basics of Tries Implementing a Trie

Tries: Supporting a Variety of Data Real-Life Applications of Tries Quiz on Tries

Prefix Search

Introduction to Prefix Searching Using Tries

Keyword Search Prefix Count

Prefix Replacement Longest Prefix Problem Challenge: Prefix Map Solution Review: Prefix Map

Suffix Search

Introduction to Suffix Searching Using Tries Suffix Count Prefix and Suffix Search Optimized Prefix and Suffix Search Suffix Stream Problem Challenge: Suffix Score Solution Review: Suffix Score

Bitwise Tries

Introduction to Bitwise Tries Maximum XOR Maximum XOR with Limit Maximum Subarray XOR Range XOR Pairs Problem Challenge: Minimum XOR Solution Review: Minimum XOR

Pattern Matching

Introduction to Pattern Matching Using Tries Pattern Matching Smart Matching Shortest Encoding Abbreviation Generator Problem Challenge: Insertion Count Solution Review: Insertion Count

File Systems

7 Lessons

Trie Traversal

7 Lessons

Search Engine

9 Lessons

Miscellaneous

7 Lessons

Conclusion

2 Lessons

Course Author

Trusted by 1.4 million developers working at companies

Anthony Walker

@_webarchitect_

Emma Bostian 🐞

@EmmaBostian

Evan Dunbar

ML Engineer

Carlos Matias La Borde

Software Developer

Souvik Kundu

Front-end Developer

Vinay Krishnaiah

Software Developer

Eric Downs

Musician/Entrepeneur

Kenan Eyvazov

DevOps Engineer

Anthony Walker

@_webarchitect_

Emma Bostian 🐞

@EmmaBostian

Hands-on Learning Powered by AI

See how Educative uses AI to make your learning more immersive than ever before.

Instant Code Feedback

Evaluate and debug your code with the click of a button. Get real-time feedback on test cases, including time and space complexity of your solutions.

AI-Powered Mock Interviews

Put your skills to the test in a simulated interview setting. Receive personalized feedback based on your performance. Available in Premium & Premium Plus plans.

Adaptive Learning

At various checkpoints throughout Educative courses, you will be prompted to take a quick assessment. Receive a condensed curriculum tailored to your strengths and skill gaps.

Explain with AI

Select any text within any Educative course, and get an instant explanation — without ever leaving your browser.

AI Code Mentor

AI Code Mentor helps you quickly identify errors in your code, learn from your mistakes, and nudge you in the right direction — just like a 1:1 tutor!

Looking for something else?

FOR TEAMS

Interested in this course for your business or team?

Unlock this course (and 1,000+ more) for your entire org with DevPath