Mock Interview Quiz Books Prep Path Coding Challenges

← Back to books

Chapters

01Chapter 1: How to Use This Book 02Chapter 2: Complexity Analysis Essentials 03Chapter 3: Two Pointers 04Chapter 4: Fast & Slow Pointers 05Chapter 5: Sliding Window 06Chapter 6: Merge Intervals 07Chapter 7: Binary Search 08Chapter 8: Linked List Manipulation 09Chapter 9: Stack & Monotonic Stack 10Chapter 10: Heap / Priority Queue (Top K Elements)11Chapter 11: Binary Tree Traversal 12Chapter 12: Binary Search Tree (BST)13Chapter 13: Tries (Prefix Trees)14Chapter 14: Backtracking 15Chapter 15: Graph Traversal (BFS & DFS)16Chapter 16: Advanced Graph Algorithms 17Chapter 17: Dynamic Programming - 1D 18Chapter 18: Dynamic Programming - 2D 19Chapter 19: Bit Manipulation 20Chapter 20: Math & Geometry 21Chapter 21: Problem-Solving Strategies 22Chapter 22: Pattern Quick Reference 23Chapter 23: Mock Interview Problems 24Chapter 24: Final Review & Next Steps

Chapter 13: Tries (Prefix Trees)

Prev chapter Next chapter

AndroidHire - Android interview prep with structured quizzes and deep context.

Privacy Policy · Support