Advanced Data Structures: Implementing Tries in C++ and Java
Gain insights into trie data structures, their implementation in C++ and Java, and their application in solving algorithmic problems and designing complex systems, enhancing your software engineering skills.
Join 3.1 million developers at
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
Learning Roadmap
1.
Introduction to Tries
Introduction to Tries
2.
Prefix Search
Prefix Search
3.
Suffix Search
Suffix Search
7 Lessons
7 Lessons
4.
Bitwise Tries
Bitwise Tries
7 Lessons
7 Lessons
5.
Pattern Matching
Pattern Matching
7 Lessons
7 Lessons
6.
File Systems
File Systems
7 Lessons
7 Lessons
7.
Trie Traversal
Trie Traversal
7 Lessons
7 Lessons
8.
Search Engine
Search Engine
9 Lessons
9 Lessons
9.
Miscellaneous
Miscellaneous
7 Lessons
7 Lessons
10.
Conclusion
Conclusion
2 Lessons
2 Lessons
Ankur Malik
I AM A SOFTWARE ENGINEER WITH A DEEP INTEREST IN SYSTEM DESIGNING. I HAVE BEEN INVOLVED IN VARIOUS MENTORING PROGRAMS FOR SWE INTERVIEW PREPARATIONS.
Trusted by 3.1 million developers working at companies
Anthony Walker
@_webarchitect_
Evan Dunbar
ML Engineer
Software Developer
Carlos Matias La Borde
Souvik Kundu
Front-end Developer
Vinay Krishnaiah
Software Developer
Built for 10x Developers











